Base | Representation |
---|---|
bin | 10010101010111100… |
… | …11001010100000000 |
3 | 221212120212020020020 |
4 | 21111132121110000 |
5 | 131012113402302 |
6 | 4334400213440 |
7 | 503255206350 |
oct | 112536312400 |
9 | 27776766206 |
10 | 10023965952 |
11 | 42842a3a90 |
12 | 1b3900a280 |
13 | c3995bb00 |
14 | 6b1400b60 |
15 | 3da043ebc |
hex | 255799500 |
10023965952 has 864 divisors, whose sum is σ = 38781711360. Its totient is φ = 2223636480.
The previous prime is 10023965947. The next prime is 10023965953. The reversal of 10023965952 is 25956932001.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10023965953) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 169897699 + ... + 169897757.
It is an arithmetic number, because the mean of its divisors is an integer number (44886240).
Almost surely, 210023965952 is an apocalyptic number.
10023965952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10023965952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19390855680).
10023965952 is an abundant number, since it is smaller than the sum of its proper divisors (28757745408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10023965952 is a wasteful number, since it uses less digits than its factorization.
10023965952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139 (or 112 counting only the distinct ones).
The product of its (nonzero) digits is 145800, while the sum is 42.
The spelling of 10023965952 in words is "ten billion, twenty-three million, nine hundred sixty-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •