Base | Representation |
---|---|
bin | 1001001011111111010001… |
… | …01101011000100100010110 |
3 | 2122112101211020120020021201 |
4 | 10211333220231120210112 |
5 | 10122002010130414220 |
6 | 110545105310503114 |
7 | 4153425346331215 |
oct | 445775055304426 |
9 | 78471736506251 |
10 | 20203135404310 |
11 | 648a113271971 |
12 | 2323605204a9a |
13 | b371bc075a21 |
14 | 4dbba091107c |
15 | 2507e36e8d0a |
hex | 125fe8b58916 |
20203135404310 has 8 divisors (see below), whose sum is σ = 36365643727776. Its totient is φ = 8081254161720.
The previous prime is 20203135404241. The next prime is 20203135404317. The reversal of 20203135404310 is 1340453130202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×202031354043102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20203135404317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1010156770206 + ... + 1010156770225.
It is an arithmetic number, because the mean of its divisors is an integer number (4545705465972).
Almost surely, 220203135404310 is an apocalyptic number.
20203135404310 is a deficient number, since it is larger than the sum of its proper divisors (16162508323466).
20203135404310 is a wasteful number, since it uses less digits than its factorization.
20203135404310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2020313540438.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 20203135404310 its reverse (1340453130202), we get a palindrome (21543588534512).
The spelling of 20203135404310 in words is "twenty trillion, two hundred three billion, one hundred thirty-five million, four hundred four thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •