Base | Representation |
---|---|
bin | 1011111010101001100111… |
… | …0010001110001101000110 |
3 | 1201101120010221220111011121 |
4 | 2332222121302032031012 |
5 | 3204131331431112410 |
6 | 43511025335224154 |
7 | 2521414324160254 |
oct | 276523162161506 |
9 | 51346127814147 |
10 | 13102230332230 |
11 | 41a16964a2476 |
12 | 157737251805a |
13 | 7406c5589770 |
14 | 33421937b5d4 |
15 | 17ac445d09da |
hex | bea99c8e346 |
13102230332230 has 32 divisors (see below), whose sum is σ = 25444601459424. Its totient is φ = 4828902414336.
The previous prime is 13102230332189. The next prime is 13102230332237. The reversal of 13102230332230 is 3223303220131.
It is a junction number, because it is equal to n+sod(n) for n = 13102230332195 and 13102230332204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13102230332237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 92055387 + ... + 92197606.
It is an arithmetic number, because the mean of its divisors is an integer number (795143795607).
Almost surely, 213102230332230 is an apocalyptic number.
13102230332230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13102230332230 is a deficient number, since it is larger than the sum of its proper divisors (12342371127194).
13102230332230 is a wasteful number, since it uses less digits than its factorization.
13102230332230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184253560.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 13102230332230 its reverse (3223303220131), we get a palindrome (16325533552361).
The spelling of 13102230332230 in words is "thirteen trillion, one hundred two billion, two hundred thirty million, three hundred thirty-two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •