Base | Representation |
---|---|
bin | 1001000111000001010111… |
… | …0101001000010000000000 |
3 | 1022110112122021210211022110 |
4 | 2101300111311020100000 |
5 | 2303101214333430412 |
6 | 33145220441535320 |
7 | 2052435342050544 |
oct | 221602565102000 |
9 | 38415567724273 |
10 | 10016229983232 |
11 | 321194a780700 |
12 | 11592671a4540 |
13 | 5786ac7661b5 |
14 | 268b06849a24 |
15 | 125829c16d3c |
hex | 91c15d48400 |
10016229983232 has 132 divisors (see below), whose sum is σ = 29344532652848. Its totient is φ = 3035221094400.
The previous prime is 10016229983203. The next prime is 10016229983237. The reversal of 10016229983232 is 23238992261001.
It is a tau number, because it is divible by the number of its divisors (132).
It is a super-2 number, since 2×100162299832322 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is not an unprimeable number, because it can be changed into a prime (10016229983237) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13101394 + ... + 13844817.
Almost surely, 210016229983232 is an apocalyptic number.
10016229983232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10016229983232 is an abundant number, since it is smaller than the sum of its proper divisors (19328302669616).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10016229983232 is a wasteful number, since it uses less digits than its factorization.
10016229983232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26946256 (or 26946227 counting only the distinct ones).
The product of its (nonzero) digits is 559872, while the sum is 48.
The spelling of 10016229983232 in words is "ten trillion, sixteen billion, two hundred twenty-nine million, nine hundred eighty-three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •