Base | Representation |
---|---|
bin | 1001011000001000011111… |
… | …0100100011011001010111 |
3 | 1100111122102120122200121020 |
4 | 2112002013310203121113 |
5 | 2322410242223223111 |
6 | 33532235100052223 |
7 | 2112613241545350 |
oct | 226020764433127 |
9 | 40448376580536 |
10 | 10310200211031 |
11 | 3315593261896 |
12 | 11a6229234073 |
13 | 59a32b2a3956 |
14 | 279032c2cd27 |
15 | 12d2d2d5b906 |
hex | 96087d23657 |
10310200211031 has 32 divisors (see below), whose sum is σ = 15741410420736. Its totient is φ = 5880068220000.
The previous prime is 10310200211027. The next prime is 10310200211057. The reversal of 10310200211031 is 13011200201301.
It is a happy number.
It is not a de Polignac number, because 10310200211031 - 22 = 10310200211027 is a prime.
It is a super-2 number, since 2×103102002110312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10310200211031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310200211081) 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, 22014856 + ... + 22478306.
It is an arithmetic number, because the mean of its divisors is an integer number (491919075648).
Almost surely, 210310200211031 is an apocalyptic number.
10310200211031 is a deficient number, since it is larger than the sum of its proper divisors (5431210209705).
10310200211031 is a wasteful number, since it uses less digits than its factorization.
10310200211031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 465523.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10310200211031 its reverse (13011200201301), we get a palindrome (23321400412332).
The spelling of 10310200211031 in words is "ten trillion, three hundred ten billion, two hundred million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •