Base | Representation |
---|---|
bin | 1010111011010000101101… |
… | …0011111110000000101110 |
3 | 1120112110012111020211222011 |
4 | 2232310023103332000232 |
5 | 3033311030101423042 |
6 | 41314443301111434 |
7 | 2346632424214120 |
oct | 256641323760056 |
9 | 46473174224864 |
10 | 12013213311022 |
11 | 3911858803a60 |
12 | 14202a89b857a |
13 | 691ac2029511 |
14 | 2d762a7d3210 |
15 | 15c757e5aa17 |
hex | aed0b4fe02e |
12013213311022 has 16 divisors (see below), whose sum is σ = 22466269049472. Its totient is φ = 4680472718520.
The previous prime is 12013213311013. The next prime is 12013213311049. The reversal of 12013213311022 is 22011331231021.
It is a super-2 number, since 2×120132133110222 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 12013213310984 and 12013213311002.
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, 39003939168 + ... + 39003939475.
It is an arithmetic number, because the mean of its divisors is an integer number (1404141815592).
Almost surely, 212013213311022 is an apocalyptic number.
12013213311022 is a deficient number, since it is larger than the sum of its proper divisors (10453055738450).
12013213311022 is a wasteful number, since it uses less digits than its factorization.
12013213311022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78007878663.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 12013213311022 its reverse (22011331231021), we get a palindrome (34024544542043).
The spelling of 12013213311022 in words is "twelve trillion, thirteen billion, two hundred thirteen million, three hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •