Base | Representation |
---|---|
bin | 1001001001010111100100… |
… | …10000100101010000000110 |
3 | 2122012210102121112111201101 |
4 | 10210223302100211100012 |
5 | 10114013112414004110 |
6 | 110435455311450314 |
7 | 4144060254226165 |
oct | 444536220452006 |
9 | 78183377474641 |
10 | 20113101313030 |
11 | 6454a11386570 |
12 | 230a078b2699a |
13 | b2b8711784bb |
14 | 4d769d29b3dc |
15 | 24d2c438613a |
hex | 124af2425406 |
20113101313030 has 32 divisors (see below), whose sum is σ = 39497899891968. Its totient is φ = 7313284140000.
The previous prime is 20113101313001. The next prime is 20113101313031. The reversal of 20113101313030 is 3031310131102.
It is a super-2 number, since 2×201131013130302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20113101312989 and 20113101313007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20113101313031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5719096 + ... + 8540155.
It is an arithmetic number, because the mean of its divisors is an integer number (1234309371624).
Almost surely, 220113101313030 is an apocalyptic number.
20113101313030 is a deficient number, since it is larger than the sum of its proper divisors (19384798578938).
20113101313030 is a wasteful number, since it uses less digits than its factorization.
20113101313030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14272092.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 20113101313030 its reverse (3031310131102), we get a palindrome (23144411444132).
The spelling of 20113101313030 in words is "twenty trillion, one hundred thirteen billion, one hundred one million, three hundred thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •