Base | Representation |
---|---|
bin | 1001010010111000100010… |
… | …1011100100101100000111 |
3 | 1100012000122210021121210022 |
4 | 2110232020223210230013 |
5 | 2314421100200233111 |
6 | 33423002412045355 |
7 | 2103241426252223 |
oct | 224561053445407 |
9 | 40160583247708 |
10 | 10220020321031 |
11 | 3290317043784 |
12 | 119086016385b |
13 | 5919891188b1 |
14 | 27491a0a5783 |
15 | 12aca5ce92db |
hex | 94b88ae4b07 |
10220020321031 has 16 divisors (see below), whose sum is σ = 11138455535616. Its totient is φ = 9340058883456.
The previous prime is 10220020321009. The next prime is 10220020321037. The reversal of 10220020321031 is 13012302002201.
It is a cyclic number.
It is not a de Polignac number, because 10220020321031 - 230 = 10218946579207 is a prime.
It is a super-2 number, since 2×102200203210312 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10220020321037) 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, 50256851 + ... + 50459796.
It is an arithmetic number, because the mean of its divisors is an integer number (696153470976).
Almost surely, 210220020321031 is an apocalyptic number.
10220020321031 is a deficient number, since it is larger than the sum of its proper divisors (918435214585).
10220020321031 is a wasteful number, since it uses less digits than its factorization.
10220020321031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100716838.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10220020321031 its reverse (13012302002201), we get a palindrome (23232322323232).
The spelling of 10220020321031 in words is "ten trillion, two hundred twenty billion, twenty million, three hundred twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •