Base | Representation |
---|---|
bin | 1001010001110011010000… |
… | …0001000110010100001011 |
3 | 1100010020122111112222222112 |
4 | 2110130310001012110023 |
5 | 2314120002011444433 |
6 | 33410245003212535 |
7 | 2102012461353140 |
oct | 224346401062413 |
9 | 40106574488875 |
10 | 10201420031243 |
11 | 3283441725761 |
12 | 118912ab1714b |
13 | 58ccb371a86c |
14 | 273a73a583c7 |
15 | 12a567db7348 |
hex | 9473404650b |
10201420031243 has 32 divisors (see below), whose sum is σ = 11999592253440. Its totient is φ = 8492141623680.
The previous prime is 10201420031227. The next prime is 10201420031251. The reversal of 10201420031243 is 34213002410201.
It is a cyclic number.
It is not a de Polignac number, because 10201420031243 - 24 = 10201420031227 is a prime.
It is a super-2 number, since 2×102014200312432 (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 (10201420031203) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 19030238 + ... + 19558956.
It is an arithmetic number, because the mean of its divisors is an integer number (374987257920).
Almost surely, 210201420031243 is an apocalyptic number.
10201420031243 is a deficient number, since it is larger than the sum of its proper divisors (1798172222197).
10201420031243 is a wasteful number, since it uses less digits than its factorization.
10201420031243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529307.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 10201420031243 its reverse (34213002410201), we get a palindrome (44414422441444).
The spelling of 10201420031243 in words is "ten trillion, two hundred one billion, four hundred twenty million, thirty-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •