Base | Representation |
---|---|
bin | 1001001001101010100100… |
… | …10001001100011110100111 |
3 | 2122020202202111222011110102 |
4 | 10210311102101030132213 |
5 | 10114200010304133111 |
6 | 110444303424214315 |
7 | 4144601116634516 |
oct | 444652221143647 |
9 | 78222674864412 |
10 | 20123302021031 |
11 | 6459276417460 |
12 | 231004516a39b |
13 | b2c80860a2b1 |
14 | 4d7d89d4867d |
15 | 24d6beb8d13b |
hex | 124d5244c7a7 |
20123302021031 has 32 divisors (see below), whose sum is σ = 22055027245056. Its totient is φ = 18208888236000.
The previous prime is 20123302021027. The next prime is 20123302021079. The reversal of 20123302021031 is 13012020332102.
It is not a de Polignac number, because 20123302021031 - 22 = 20123302021027 is a prime.
It is a super-2 number, since 2×201233020210312 (a number of 27 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 = 20123302020994 and 20123302021012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20123302021531) 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, 4778744516 + ... + 4778748726.
It is an arithmetic number, because the mean of its divisors is an integer number (689219601408).
Almost surely, 220123302021031 is an apocalyptic number.
20123302021031 is a deficient number, since it is larger than the sum of its proper divisors (1931725224025).
20123302021031 is a wasteful number, since it uses less digits than its factorization.
20123302021031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6803.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20123302021031 its reverse (13012020332102), we get a palindrome (33135322353133).
The spelling of 20123302021031 in words is "twenty trillion, one hundred twenty-three billion, three hundred two million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •