Base | Representation |
---|---|
bin | 10011001000001101… |
… | …11010010001000000 |
3 | 222111200211000100000 |
4 | 21210012322101000 |
5 | 132012440431322 |
6 | 4415010200000 |
7 | 512326015050 |
oct | 114406722100 |
9 | 28450730300 |
10 | 10269467712 |
11 | 439a9350a9 |
12 | 1ba7283000 |
13 | c78787c1a |
14 | 6d5c69560 |
15 | 40188a3ac |
hex | 2641ba440 |
10269467712 has 672 divisors, whose sum is σ = 38343352320. Its totient is φ = 2657525760.
The previous prime is 10269467699. The next prime is 10269467717. The reversal of 10269467712 is 21776496201.
It is a tau number, because it is divible by the number of its divisors (672).
It is not an unprimeable number, because it can be changed into a prime (10269467717) 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, 57371239 + ... + 57371417.
It is an arithmetic number, because the mean of its divisors is an integer number (57058560).
Almost surely, 210269467712 is an apocalyptic number.
10269467712 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 10269467712, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19171676160).
10269467712 is an abundant number, since it is smaller than the sum of its proper divisors (28073884608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10269467712 is a wasteful number, since it uses less digits than its factorization.
10269467712 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 261 (or 239 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 45.
The spelling of 10269467712 in words is "ten billion, two hundred sixty-nine million, four hundred sixty-seven thousand, seven hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •