Base | Representation |
---|---|
bin | 1011110101111110110011… |
… | …1100010010101011101001 |
3 | 1201002220010001002102200110 |
4 | 2331133230330102223221 |
5 | 3201323044400233223 |
6 | 43410122305124533 |
7 | 2512544552030016 |
oct | 275375474225351 |
9 | 51086101072613 |
10 | 13022021102313 |
11 | 4170676479903 |
12 | 1563908629749 |
13 | 735c81cb8482 |
14 | 3303aa8da70d |
15 | 178aeca82d93 |
hex | bd7ecf12ae9 |
13022021102313 has 16 divisors (see below), whose sum is σ = 17369481916800. Its totient is φ = 8677954425600.
The previous prime is 13022021102221. The next prime is 13022021102399. The reversal of 13022021102313 is 31320112022031.
It is not a de Polignac number, because 13022021102313 - 217 = 13022020971241 is a prime.
It is a super-2 number, since 2×130220211023132 (a number of 27 digits) contains 22 as substring.
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 13022021102313.
It is not an unprimeable number, because it can be changed into a prime (13022021100313) 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, 98073073 + ... + 98205761.
It is an arithmetic number, because the mean of its divisors is an integer number (1085592619800).
Almost surely, 213022021102313 is an apocalyptic number.
It is an amenable number.
13022021102313 is a deficient number, since it is larger than the sum of its proper divisors (4347460814487).
13022021102313 is a wasteful number, since it uses less digits than its factorization.
13022021102313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145232.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 13022021102313 its reverse (31320112022031), we get a palindrome (44342133124344).
The spelling of 13022021102313 in words is "thirteen trillion, twenty-two billion, twenty-one million, one hundred two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •