Base | Representation |
---|---|
bin | 1011101111001100… |
… | …1010111010000000 |
3 | 22010120200212010200 |
4 | 2323303022322000 |
5 | 22423043102113 |
6 | 1240351325200 |
7 | 141035650665 |
oct | 27363127200 |
9 | 8116625120 |
10 | 3150753408 |
11 | 1377577740 |
12 | 73b220800 |
13 | 3b29b833a |
14 | 21c649a6c |
15 | 136921873 |
hex | bbccae80 |
3150753408 has 96 divisors (see below), whose sum is σ = 9890899200. Its totient is φ = 954769920.
The previous prime is 3150753373. The next prime is 3150753421. The reversal of 3150753408 is 8043570513.
3150753408 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×31507534082 = 19854494076047228928, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 111648 + ... + 136991.
It is an arithmetic number, because the mean of its divisors is an integer number (103030200).
Almost surely, 23150753408 is an apocalyptic number.
It is an amenable number.
3150753408 is an abundant number, since it is smaller than the sum of its proper divisors (6740145792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3150753408 is a wasteful number, since it uses less digits than its factorization.
3150753408 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 248670 (or 248655 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The square root of 3150753408 is about 56131.5722922492. The cubic root of 3150753408 is about 1466.0140692640.
The spelling of 3150753408 in words is "three billion, one hundred fifty million, seven hundred fifty-three thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •