Base | Representation |
---|---|
bin | 1001101100110000000101… |
… | …1000100001111101001001 |
3 | 1101202111202020212012111121 |
4 | 2123030001120201331021 |
5 | 2344211221303104341 |
6 | 34403100425355241 |
7 | 2150323304604361 |
oct | 233140130417511 |
9 | 41674666765447 |
10 | 10664427003721 |
11 | 3441838028037 |
12 | 1242a07038b21 |
13 | 5c486076c12a |
14 | 28c237bad9a1 |
15 | 137615ed34d1 |
hex | 9b301621f49 |
10664427003721 has 8 divisors (see below), whose sum is σ = 11301455414304. Its totient is φ = 10028477390400.
The previous prime is 10664427003689. The next prime is 10664427003733. The reversal of 10664427003721 is 12730072446601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10664427003721 - 25 = 10664427003689 is a prime.
It is a super-2 number, since 2×106644270037212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10664427003751) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 269678955 + ... + 269718496.
It is an arithmetic number, because the mean of its divisors is an integer number (1412681926788).
Almost surely, 210664427003721 is an apocalyptic number.
It is an amenable number.
10664427003721 is a deficient number, since it is larger than the sum of its proper divisors (637028410583).
10664427003721 is a wasteful number, since it uses less digits than its factorization.
10664427003721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539398631.
The product of its (nonzero) digits is 338688, while the sum is 43.
The spelling of 10664427003721 in words is "ten trillion, six hundred sixty-four billion, four hundred twenty-seven million, three thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •