Base | Representation |
---|---|
bin | 10011001100101011… |
… | …11010000000000000 |
3 | 222121022100110210000 |
4 | 21212111322000000 |
5 | 132102040000331 |
6 | 4422425440000 |
7 | 513262441200 |
oct | 114625720000 |
9 | 28538313700 |
10 | 10306953216 |
11 | 440a00855a |
12 | 1bb7940000 |
13 | c834810b1 |
14 | 6dac26400 |
15 | 404ce20e6 |
hex | 26657a000 |
10306953216 has 420 divisors, whose sum is σ = 35931949218. Its totient is φ = 2935554048.
The previous prime is 10306953203. The next prime is 10306953271. The reversal of 10306953216 is 61235960301.
10306953216 is a `hidden beast` number, since 103 + 0 + 6 + 9 + 532 + 16 = 666.
It can be written as a sum of positive squares in only one way, i.e., 10160640000 + 146313216 = 100800^2 + 12096^2 .
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 29 ways as a sum of consecutive naturals, for example, 32513890 + ... + 32514206.
Almost surely, 210306953216 is an apocalyptic number.
10306953216 is a gapful number since it is divisible by the number (16) 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 10306953216, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17965974609).
10306953216 is an abundant number, since it is smaller than the sum of its proper divisors (25624996002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10306953216 is an frugal number, since it uses more digits than its factorization.
10306953216 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 369 (or 329 counting only the distinct ones).
The product of its (nonzero) digits is 29160, while the sum is 36.
The spelling of 10306953216 in words is "ten billion, three hundred six million, nine hundred fifty-three thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •