Base | Representation |
---|---|
bin | 1001010010000101001110… |
… | …0011100000100011110000 |
3 | 1100010201002200220201120022 |
4 | 2110201103203200203300 |
5 | 2314204341443100444 |
6 | 33412403412103012 |
7 | 2102243146361300 |
oct | 224412343404360 |
9 | 40121080821508 |
10 | 10206244112624 |
11 | 32854977a847a |
12 | 118a056604a68 |
13 | 5905a1ca41a1 |
14 | 273db0605600 |
15 | 12a74b66e9ee |
hex | 948538e08f0 |
10206244112624 has 60 divisors (see below), whose sum is σ = 23031967281624. Its totient is φ = 4368616140672.
The previous prime is 10206244112551. The next prime is 10206244112641. The reversal of 10206244112624 is 42621144260201.
It is a happy number.
It is a super-2 number, since 2×102062441126242 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7542134 + ... + 8791829.
Almost surely, 210206244112624 is an apocalyptic number.
10206244112624 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10206244112624 is an abundant number, since it is smaller than the sum of its proper divisors (12825723169000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10206244112624 is a wasteful number, since it uses less digits than its factorization.
10206244112624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16334782 (or 16334769 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 35.
Adding to 10206244112624 its reverse (42621144260201), we get a palindrome (52827388372825).
The spelling of 10206244112624 in words is "ten trillion, two hundred six billion, two hundred forty-four million, one hundred twelve thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •