Base | Representation |
---|---|
bin | 1001001001010111111100… |
… | …01011100011110100010111 |
3 | 2122012210221112220001212012 |
4 | 10210223332023203310113 |
5 | 10114014020114314111 |
6 | 110435531214414435 |
7 | 4144065233254550 |
oct | 444537613436427 |
9 | 78183845801765 |
10 | 20113301323031 |
11 | 6455004275a94 |
12 | 230a113b0141b |
13 | b2b8a3737207 |
14 | 4d76bba83327 |
15 | 24d2d6be348b |
hex | 124afe2e3d17 |
20113301323031 has 16 divisors (see below), whose sum is σ = 24338936611584. Its totient is φ = 16225755318144.
The previous prime is 20113301323021. The next prime is 20113301323091. The reversal of 20113301323031 is 13032310331102.
It is a cyclic number.
It is not a de Polignac number, because 20113301323031 - 218 = 20113301060887 is a prime.
It is a super-2 number, since 2×201133013230312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20113301322988 and 20113301323006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20113301323021) 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, 23038616 + ... + 23895698.
It is an arithmetic number, because the mean of its divisors is an integer number (1521183538224).
Almost surely, 220113301323031 is an apocalyptic number.
20113301323031 is a deficient number, since it is larger than the sum of its proper divisors (4225635288553).
20113301323031 is a wasteful number, since it uses less digits than its factorization.
20113301323031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1054310.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 20113301323031 its reverse (13032310331102), we get a palindrome (33145611654133).
The spelling of 20113301323031 in words is "twenty trillion, one hundred thirteen billion, three hundred one million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •