Base | Representation |
---|---|
bin | 1001101010001111100111… |
… | …1011100110010111110110 |
3 | 1101121101120022012211212220 |
4 | 2122203321323212113312 |
5 | 2343010012142244131 |
6 | 34331214253223210 |
7 | 2144240003660640 |
oct | 232437173462766 |
9 | 41541508184786 |
10 | 10621352306166 |
11 | 342554352a238 |
12 | 12365a5491b06 |
13 | 5c07876b0604 |
14 | 28a10d113890 |
15 | 1364445eee96 |
hex | 9a8f9ee65f6 |
10621352306166 has 32 divisors (see below), whose sum is σ = 24278338595328. Its totient is φ = 3034551850560.
The previous prime is 10621352306111. The next prime is 10621352306167. The reversal of 10621352306166 is 66160325312601.
It is a super-2 number, since 2×106213523061662 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10621352306167) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3934495 + ... + 6059946.
It is an arithmetic number, because the mean of its divisors is an integer number (758698081104).
Almost surely, 210621352306166 is an apocalyptic number.
10621352306166 is an abundant number, since it is smaller than the sum of its proper divisors (13656986289162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10621352306166 is a wasteful number, since it uses less digits than its factorization.
10621352306166 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10019756.
The product of its (nonzero) digits is 233280, while the sum is 42.
Adding to 10621352306166 its reverse (66160325312601), we get a palindrome (76781677618767).
The spelling of 10621352306166 in words is "ten trillion, six hundred twenty-one billion, three hundred fifty-two million, three hundred six thousand, one hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •