Base | Representation |
---|---|
bin | 1011000110110010010011… |
… | …1101100001011110111000 |
3 | 1121020101021100222000111112 |
4 | 2301230210331201132320 |
5 | 3100032030301131412 |
6 | 41545430423015452 |
7 | 2400142135340603 |
oct | 261544475413670 |
9 | 47211240860445 |
10 | 12211212130232 |
11 | 39888229a1435 |
12 | 145274629a588 |
13 | 6a7687879a3b |
14 | 303050bcd33a |
15 | 162995887722 |
hex | b1b24f617b8 |
12211212130232 has 32 divisors (see below), whose sum is σ = 24433736209920. Its totient is φ = 5701205099520.
The previous prime is 12211212130199. The next prime is 12211212130261. The reversal of 12211212130232 is 23203121211221.
It is a super-2 number, since 2×122112121302322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12211212130198 and 12211212130207.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 353480069 + ... + 353514612.
It is an arithmetic number, because the mean of its divisors is an integer number (763554256560).
Almost surely, 212211212130232 is an apocalyptic number.
It is an amenable number.
12211212130232 is an abundant number, since it is smaller than the sum of its proper divisors (12222524079688).
12211212130232 is a wasteful number, since it uses less digits than its factorization.
12211212130232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 706994831 (or 706994827 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 12211212130232 its reverse (23203121211221), we get a palindrome (35414333341453).
The spelling of 12211212130232 in words is "twelve trillion, two hundred eleven billion, two hundred twelve million, one hundred thirty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.727 sec. • engine limits •