Base | Representation |
---|---|
bin | 10010111101101101011… |
… | …111010011001010110101 |
3 | 11121120211002022120122110 |
4 | 102331231133103022311 |
5 | 132322434233342323 |
6 | 2434404244121233 |
7 | 163103544221436 |
oct | 22755537231265 |
9 | 4546732276573 |
10 | 1303212012213 |
11 | 46276422a541 |
12 | 1906a3096219 |
13 | 95b7a6b0697 |
14 | 4710bdbd48d |
15 | 23d75de7793 |
hex | 12f6d7d32b5 |
1303212012213 has 16 divisors (see below), whose sum is σ = 1738799265536. Its totient is φ = 868216527360.
The previous prime is 1303212012127. The next prime is 1303212012229. The reversal of 1303212012213 is 3122102123031.
It is not a de Polignac number, because 1303212012213 - 212 = 1303212008117 is a prime.
It is a super-2 number, since 2×13032120122132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1303212012213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1303212012283) 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, 52755681 + ... + 52780377.
It is an arithmetic number, because the mean of its divisors is an integer number (108674954096).
Almost surely, 21303212012213 is an apocalyptic number.
It is an amenable number.
1303212012213 is a deficient number, since it is larger than the sum of its proper divisors (435587253323).
1303212012213 is a wasteful number, since it uses less digits than its factorization.
1303212012213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35964.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1303212012213 its reverse (3122102123031), we get a palindrome (4425314135244).
The spelling of 1303212012213 in words is "one trillion, three hundred three billion, two hundred twelve million, twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •