Base | Representation |
---|---|
bin | 1111011001001110100000… |
… | …1101110001010001100100 |
3 | 2012221010010201100020200220 |
4 | 3312103220031301101210 |
5 | 4204304041132220202 |
6 | 55555421115204340 |
7 | 3364603502153010 |
oct | 366235015612144 |
9 | 65833121306626 |
10 | 16926067070052 |
11 | 5436339665868 |
12 | 1a944757466b0 |
13 | 95a17659bb0a |
14 | 427324297540 |
15 | 1e5444b08abc |
hex | f64e8371464 |
16926067070052 has 24 divisors (see below), whose sum is σ = 45136178853696. Its totient is φ = 4836019162848.
The previous prime is 16926067069991. The next prime is 16926067070063. The reversal of 16926067070052 is 25007076062961.
It is a junction number, because it is equal to n+sod(n) for n = 16926067069977 and 16926067070004.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100750399143 + ... + 100750399310.
It is an arithmetic number, because the mean of its divisors is an integer number (1880674118904).
Almost surely, 216926067070052 is an apocalyptic number.
16926067070052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
16926067070052 is an abundant number, since it is smaller than the sum of its proper divisors (28210111783644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16926067070052 is a wasteful number, since it uses less digits than its factorization.
16926067070052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201500798467 (or 201500798465 counting only the distinct ones).
The product of its (nonzero) digits is 1905120, while the sum is 51.
The spelling of 16926067070052 in words is "sixteen trillion, nine hundred twenty-six billion, sixty-seven million, seventy thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •