Base | Representation |
---|---|
bin | 1001010111100111000000… |
… | …0010101100100111011001 |
3 | 1100110210020010111021100211 |
4 | 2111321300002230213121 |
5 | 2322233340100043113 |
6 | 33524151113131121 |
7 | 2112144422410210 |
oct | 225716002544731 |
9 | 40423203437324 |
10 | 10301211331033 |
11 | 33117a0276247 |
12 | 11a453a9b9aa1 |
13 | 599527c17c4c |
14 | 27881d0b0077 |
15 | 12ce58b29b3d |
hex | 95e700ac9d9 |
10301211331033 has 32 divisors (see below), whose sum is σ = 11885045760000. Its totient is φ = 8745785442240.
The previous prime is 10301211330997. The next prime is 10301211331043. The reversal of 10301211331033 is 33013311210301.
It is a de Polignac number, because none of the positive numbers 2k-10301211331033 is a prime.
It is a super-2 number, since 2×103012113310332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10301211330995 and 10301211331013.
It is not an unprimeable number, because it can be changed into a prime (10301211331043) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1866496848 + ... + 1866502366.
It is an arithmetic number, because the mean of its divisors is an integer number (371407680000).
Almost surely, 210301211331033 is an apocalyptic number.
It is an amenable number.
10301211331033 is a deficient number, since it is larger than the sum of its proper divisors (1583834428967).
10301211331033 is a wasteful number, since it uses less digits than its factorization.
10301211331033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10365.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 10301211331033 its reverse (33013311210301), we get a palindrome (43314522541334).
The spelling of 10301211331033 in words is "ten trillion, three hundred one billion, two hundred eleven million, three hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •