Base | Representation |
---|---|
bin | 1001001001110111010000… |
… | …01011111110111000011001 |
3 | 2122021102100010112022122212 |
4 | 10210323220023332320121 |
5 | 10114302432211014223 |
6 | 110451351302124505 |
7 | 4145231642351336 |
oct | 444735013767031 |
9 | 78242303468585 |
10 | 20130112204313 |
11 | 6461150603a01 |
12 | 2311425a20735 |
13 | b303524b3047 |
14 | 4d84345b398d |
15 | 24d96c9b0278 |
hex | 124ee82fee19 |
20130112204313 has 4 divisors (see below), whose sum is σ = 20413634911488. Its totient is φ = 19846589497140.
The previous prime is 20130112204309. The next prime is 20130112204339. The reversal of 20130112204313 is 31340221103102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20130112204313 - 22 = 20130112204309 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20130112204343) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 141761353481 + ... + 141761353622.
It is an arithmetic number, because the mean of its divisors is an integer number (5103408727872).
Almost surely, 220130112204313 is an apocalyptic number.
It is an amenable number.
20130112204313 is a deficient number, since it is larger than the sum of its proper divisors (283522707175).
20130112204313 is an equidigital number, since it uses as much as digits as its factorization.
20130112204313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 283522707174.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 20130112204313 its reverse (31340221103102), we get a palindrome (51470333307415).
The spelling of 20130112204313 in words is "twenty trillion, one hundred thirty billion, one hundred twelve million, two hundred four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •