Base | Representation |
---|---|
bin | 1001100100111011… |
… | …10110001110000001 |
3 | 111021022221000001122 |
4 | 10302131312032001 |
5 | 41012230333403 |
6 | 2210111242025 |
7 | 241262216045 |
oct | 46235661601 |
9 | 14238830048 |
10 | 5141652353 |
11 | 21a9368572 |
12 | bb5b19315 |
13 | 63c2c7056 |
14 | 36ac16025 |
15 | 2015d7838 |
hex | 132776381 |
5141652353 has 8 divisors (see below), whose sum is σ = 5386281600. Its totient is φ = 4901511888.
The previous prime is 5141652331. The next prime is 5141652391. The reversal of 5141652353 is 3532561415.
5141652353 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5141652353 - 28 = 5141652097 is a prime.
It is a super-2 number, since 2×51416523532 = 52873177838220873218, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5141655353) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1119851 + ... + 1124432.
It is an arithmetic number, because the mean of its divisors is an integer number (673285200).
Almost surely, 25141652353 is an apocalyptic number.
It is an amenable number.
5141652353 is a deficient number, since it is larger than the sum of its proper divisors (244629247).
5141652353 is a wasteful number, since it uses less digits than its factorization.
5141652353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2244391.
The product of its digits is 54000, while the sum is 35.
The square root of 5141652353 is about 71705.3160721017. The cubic root of 5141652353 is about 1725.9739486881.
The spelling of 5141652353 in words is "five billion, one hundred forty-one million, six hundred fifty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •