Base | Representation |
---|---|
bin | 1011000110111001000001… |
… | …0000010000001011110110 |
3 | 1121020112220211010011001210 |
4 | 2301232100100100023312 |
5 | 3100044222110432410 |
6 | 41550325204502250 |
7 | 2400234553605120 |
oct | 261562020201366 |
9 | 47215824104053 |
10 | 12213012202230 |
11 | 3989566aa5144 |
12 | 1452b690aa986 |
13 | 6a78b37937b8 |
14 | 303181cc4210 |
15 | 162a4d907220 |
hex | b1b904102f6 |
12213012202230 has 32 divisors (see below), whose sum is σ = 33498547755264. Its totient is φ = 2791545646176.
The previous prime is 12213012202217. The next prime is 12213012202337. The reversal of 12213012202230 is 3220221031221.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 12213012202197 and 12213012202206.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29078600272 + ... + 29078600691.
It is an arithmetic number, because the mean of its divisors is an integer number (1046829617352).
Almost surely, 212213012202230 is an apocalyptic number.
12213012202230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12213012202230 is an abundant number, since it is smaller than the sum of its proper divisors (21285535553034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12213012202230 is a wasteful number, since it uses less digits than its factorization.
12213012202230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58157200980.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 12213012202230 its reverse (3220221031221), we get a palindrome (15433233233451).
The spelling of 12213012202230 in words is "twelve trillion, two hundred thirteen billion, twelve million, two hundred two thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •