Base | Representation |
---|---|
bin | 10110111110000010001101… |
… | …110111101111001000001011 |
3 | 111020200102022020222002122011 |
4 | 112332002031313233020023 |
5 | 101220102440304002311 |
6 | 554503541414240351 |
7 | 30164312021452153 |
oct | 2676021567571013 |
9 | 436612266862564 |
10 | 101020011000331 |
11 | 2a208389694875 |
12 | b3b64313560b7 |
13 | 444a1b916b387 |
14 | 1ad3574ba5763 |
15 | ba2b67c26321 |
hex | 5be08ddef20b |
101020011000331 has 4 divisors (see below), whose sum is σ = 101021056127992. Its totient is φ = 101018965872672.
The previous prime is 101020011000323. The next prime is 101020011000371. The reversal of 101020011000331 is 133000110020101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101020011000331 - 23 = 101020011000323 is a prime.
It is a super-2 number, since 2×1010200110003312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101020011000371) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 522418830 + ... + 522612163.
It is an arithmetic number, because the mean of its divisors is an integer number (25255264031998).
Almost surely, 2101020011000331 is an apocalyptic number.
101020011000331 is a deficient number, since it is larger than the sum of its proper divisors (1045127661).
101020011000331 is an equidigital number, since it uses as much as digits as its factorization.
101020011000331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1045127660.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 101020011000331 its reverse (133000110020101), we get a palindrome (234020121020432).
The spelling of 101020011000331 in words is "one hundred one trillion, twenty billion, eleven million, three hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •