Base | Representation |
---|---|
bin | 1100000000011001100100… |
… | …0110011011100001000110 |
3 | 1201202000002121021222121021 |
4 | 3000012121012123201012 |
5 | 3212241123243201410 |
6 | 44024242422341354 |
7 | 2531512106641021 |
oct | 300063106334106 |
9 | 51660077258537 |
10 | 13201003100230 |
11 | 422a572111a50 |
12 | 159253928a85a |
13 | 749b06a5b90a |
14 | 338d094201b8 |
15 | 17d5c5c00eda |
hex | c019919b846 |
13201003100230 has 64 divisors (see below), whose sum is σ = 26305563027456. Its totient is φ = 4729424112000.
The previous prime is 13201003100221. The next prime is 13201003100239. The reversal of 13201003100230 is 3200130010231.
It is an interprime number because it is at equal distance from previous prime (13201003100221) and next prime (13201003100239).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13201003100239) 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, 10519720 + ... + 11707540.
It is an arithmetic number, because the mean of its divisors is an integer number (411024422304).
Almost surely, 213201003100230 is an apocalyptic number.
13201003100230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13201003100230 is a deficient number, since it is larger than the sum of its proper divisors (13104559927226).
13201003100230 is a wasteful number, since it uses less digits than its factorization.
13201003100230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1189333.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13201003100230 its reverse (3200130010231), we get a palindrome (16401133110461).
The spelling of 13201003100230 in words is "thirteen trillion, two hundred one billion, three million, one hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •