Base | Representation |
---|---|
bin | 1100000000010110010000… |
… | …0110111100010101110110 |
3 | 1201201220210122101011022012 |
4 | 3000011210012330111312 |
5 | 3212232313143322410 |
6 | 44024014303004222 |
7 | 2531451063034133 |
oct | 300054406742566 |
9 | 51656718334265 |
10 | 13200114042230 |
11 | 422a156283575 |
12 | 159232b599672 |
13 | 7499c47c67ab |
14 | 338c6331158a |
15 | 17d572b36605 |
hex | c01641bc576 |
13200114042230 has 64 divisors (see below), whose sum is σ = 24530616766656. Its totient is φ = 5110879488000.
The previous prime is 13200114042221. The next prime is 13200114042253. The reversal of 13200114042230 is 3224041100231.
It is a junction number, because it is equal to n+sod(n) for n = 13200114042196 and 13200114042205.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 288990674 + ... + 289036346.
It is an arithmetic number, because the mean of its divisors is an integer number (383290886979).
Almost surely, 213200114042230 is an apocalyptic number.
13200114042230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13200114042230 is a deficient number, since it is larger than the sum of its proper divisors (11330502724426).
13200114042230 is a wasteful number, since it uses less digits than its factorization.
13200114042230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51233.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 13200114042230 its reverse (3224041100231), we get a palindrome (16424155142461).
The spelling of 13200114042230 in words is "thirteen trillion, two hundred billion, one hundred fourteen million, forty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •