Base | Representation |
---|---|
bin | 1011000110001101000011… |
… | …0111100000101001101110 |
3 | 1121012102110101200220002120 |
4 | 2301203100313200221232 |
5 | 3044401040100130410 |
6 | 41541054211133410 |
7 | 2366336251066203 |
oct | 261432067405156 |
9 | 47172411626076 |
10 | 12201211333230 |
11 | 3984560792647 |
12 | 1450814ba4266 |
13 | 6a675297088a |
14 | 3027828ddcaa |
15 | 1625ac8bd570 |
hex | b18d0de0a6e |
12201211333230 has 32 divisors (see below), whose sum is σ = 29283399963648. Its totient is φ = 3253601604000.
The previous prime is 12201211333169. The next prime is 12201211333231. The reversal of 12201211333230 is 3233311210221.
It is a self number, because there is not a number n which added to its sum of digits gives 12201211333230.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201211333231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1593466 + ... + 5190525.
It is an arithmetic number, because the mean of its divisors is an integer number (915106248864).
Almost surely, 212201211333230 is an apocalyptic number.
12201211333230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12201211333230 is an abundant number, since it is smaller than the sum of its proper divisors (17082188630418).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12201211333230 is a wasteful number, since it uses less digits than its factorization.
12201211333230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6843952.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 12201211333230 its reverse (3233311210221), we get a palindrome (15434522543451).
The spelling of 12201211333230 in words is "twelve trillion, two hundred one billion, two hundred eleven million, three hundred thirty-three thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •