Base | Representation |
---|---|
bin | 1001101100111100001011… |
… | …0101101111111110011101 |
3 | 1101202211010110010221011010 |
4 | 2123033002311233332131 |
5 | 2344234343200303023 |
6 | 34404354451245433 |
7 | 2150466605354556 |
oct | 233170265577635 |
9 | 41684113127133 |
10 | 10667672666013 |
11 | 3443153129170 |
12 | 1243571ba9879 |
13 | 5c4c5a00786c |
14 | 28c464c8332d |
15 | 137755e01093 |
hex | 9b3c2d6ff9d |
10667672666013 has 32 divisors (see below), whose sum is σ = 15577026296832. Its totient is φ = 6440112806400.
The previous prime is 10667672665987. The next prime is 10667672666029. The reversal of 10667672666013 is 31066627676601.
It is a happy number.
It is not a de Polignac number, because 10667672666013 - 226 = 10667605557149 is a prime.
It is a super-2 number, since 2×106676726660132 (a number of 27 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10667672661013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14869581 + ... + 15570477.
It is an arithmetic number, because the mean of its divisors is an integer number (486782071776).
Almost surely, 210667672666013 is an apocalyptic number.
It is an amenable number.
10667672666013 is a deficient number, since it is larger than the sum of its proper divisors (4909353630819).
10667672666013 is a wasteful number, since it uses less digits than its factorization.
10667672666013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 702705.
The product of its (nonzero) digits is 13716864, while the sum is 57.
The spelling of 10667672666013 in words is "ten trillion, six hundred sixty-seven billion, six hundred seventy-two million, six hundred sixty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •