Base | Representation |
---|---|
bin | 1001001001010111110000… |
… | …01110000101100000101111 |
3 | 2122012210200120201111021110 |
4 | 10210223320032011200233 |
5 | 10114013314014301111 |
6 | 110435513243203103 |
7 | 4144062610256466 |
oct | 444537016054057 |
9 | 78183616644243 |
10 | 20113201322031 |
11 | 6454a62883834 |
12 | 230a0a6516493 |
13 | b2b888ac311c |
14 | 4d76ac6919dd |
15 | 24d2cd03d5a6 |
hex | 124af838582f |
20113201322031 has 16 divisors (see below), whose sum is σ = 27370900275200. Its totient is φ = 13134824565408.
The previous prime is 20113201322009. The next prime is 20113201322041. The reversal of 20113201322031 is 13022310231102.
It is not a de Polignac number, because 20113201322031 - 25 = 20113201321999 is a prime.
It is a super-2 number, since 2×201132013220312 (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 = 20113201321989 and 20113201322007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20113201322041) 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, 334087336 + ... + 334147533.
It is an arithmetic number, because the mean of its divisors is an integer number (1710681267200).
Almost surely, 220113201322031 is an apocalyptic number.
20113201322031 is a deficient number, since it is larger than the sum of its proper divisors (7257698953169).
20113201322031 is a wasteful number, since it uses less digits than its factorization.
20113201322031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668235078.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 20113201322031 its reverse (13022310231102), we get a palindrome (33135511553133).
The spelling of 20113201322031 in words is "twenty trillion, one hundred thirteen billion, two hundred one million, three hundred twenty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •