Base | Representation |
---|---|
bin | 101011110110010000110… |
… | …001101110110001001111 |
3 | 101200001121011100002112102 |
4 | 223312100301232301033 |
5 | 343332013430431343 |
6 | 10224125003225315 |
7 | 430460634106466 |
oct | 53662061566117 |
9 | 11601534302472 |
10 | 3013201030223 |
11 | a6198947810a |
12 | 407b8ab1823b |
13 | 18b1b3759aa7 |
14 | a5ba82319dd |
15 | 535a86553b8 |
hex | 2bd90c6ec4f |
3013201030223 has 24 divisors (see below), whose sum is σ = 3131765026560. Its totient is φ = 2898966500400.
The previous prime is 3013201030219. The next prime is 3013201030243. The reversal of 3013201030223 is 3220301023103.
It is not a de Polignac number, because 3013201030223 - 22 = 3013201030219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3013201030195 and 3013201030204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3013201030243) 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 23 ways as a sum of consecutive naturals, for example, 156838088 + ... + 156857298.
It is an arithmetic number, because the mean of its divisors is an integer number (130490209440).
Almost surely, 23013201030223 is an apocalyptic number.
3013201030223 is a deficient number, since it is larger than the sum of its proper divisors (118563996337).
3013201030223 is a wasteful number, since it uses less digits than its factorization.
3013201030223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20219 (or 20188 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 3013201030223 its reverse (3220301023103), we get a palindrome (6233502053326).
The spelling of 3013201030223 in words is "three trillion, thirteen billion, two hundred one million, thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •