Base | Representation |
---|---|
bin | 10110111101110000100001… |
… | …011101011101010111100011 |
3 | 111020121121021012120021212201 |
4 | 112331300201131131113203 |
5 | 101214300033122201311 |
6 | 554451120254234031 |
7 | 30163040145264040 |
oct | 2675604135352743 |
9 | 436547235507781 |
10 | 101001012303331 |
11 | 2a20031a399598 |
12 | b3b280a7b5917 |
13 | 444847c068a2a |
14 | 1ad269188a1c7 |
15 | ba2404d479c1 |
hex | 5bdc2175d5e3 |
101001012303331 has 32 divisors (see below), whose sum is σ = 124761920440320. Its totient is φ = 79800202944000.
The previous prime is 101001012303281. The next prime is 101001012303377. The reversal of 101001012303331 is 133303210100101.
It is not a de Polignac number, because 101001012303331 - 211 = 101001012301283 is a prime.
It is a super-2 number, since 2×1010010123033312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101001012303299 and 101001012303308.
It is not an unprimeable number, because it can be changed into a prime (101001012303031) 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, 38307636 + ... + 40859233.
It is an arithmetic number, because the mean of its divisors is an integer number (3898810013760).
Almost surely, 2101001012303331 is an apocalyptic number.
101001012303331 is a deficient number, since it is larger than the sum of its proper divisors (23760908136989).
101001012303331 is a wasteful number, since it uses less digits than its factorization.
101001012303331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79167115.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 101001012303331 its reverse (133303210100101), we get a palindrome (234304222403432).
The spelling of 101001012303331 in words is "one hundred one trillion, one billion, twelve million, three hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •