Base | Representation |
---|---|
bin | 11101011101011001001… |
… | …10100111110100111000 |
3 | 10120202200212120012221101 |
4 | 32232230212213310320 |
5 | 113041003024322222 |
6 | 2053000532021144 |
7 | 133062404363542 |
oct | 16565446476470 |
9 | 3522625505841 |
10 | 1012213120312 |
11 | 360305a10a59 |
12 | 1442101617b4 |
13 | 745b362c554 |
14 | 36dc44a0692 |
15 | 1b4e3a83927 |
hex | ebac9a7d38 |
1012213120312 has 8 divisors (see below), whose sum is σ = 1897899600600. Its totient is φ = 506106560152.
The previous prime is 1012213120297. The next prime is 1012213120313. The reversal of 1012213120312 is 2130213122101.
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 1012213120312.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012213120313) 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 as a sum of consecutive naturals, namely, 63263320012 + ... + 63263320027.
It is an arithmetic number, because the mean of its divisors is an integer number (237237450075).
Almost surely, 21012213120312 is an apocalyptic number.
It is an amenable number.
1012213120312 is a deficient number, since it is larger than the sum of its proper divisors (885686480288).
1012213120312 is a wasteful number, since it uses less digits than its factorization.
1012213120312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126526640045 (or 126526640041 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1012213120312 its reverse (2130213122101), we get a palindrome (3142426242413).
The spelling of 1012213120312 in words is "one trillion, twelve billion, two hundred thirteen million, one hundred twenty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •