Base | Representation |
---|---|
bin | 11101010010110110010… |
… | …110011100001000001111 |
3 | 21010110011200101120001210 |
4 | 131102312112130020033 |
5 | 230440314112431343 |
6 | 4140450205505503 |
7 | 265304410631556 |
oct | 35226626341017 |
9 | 7113150346053 |
10 | 2013104030223 |
11 | 70683081a730 |
12 | 2861a0572293 |
13 | 117ab135b100 |
14 | 6d612d78d9d |
15 | 3757362d333 |
hex | 1d4b659c20f |
2013104030223 has 48 divisors (see below), whose sum is σ = 3206346923520. Its totient is φ = 1113557702400.
The previous prime is 2013104030207. The next prime is 2013104030239. The reversal of 2013104030223 is 3220304013102.
It is an interprime number because it is at equal distance from previous prime (2013104030207) and next prime (2013104030239).
It is not a de Polignac number, because 2013104030223 - 24 = 2013104030207 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2013104030223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013104030293) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1531543 + ... + 2524248.
It is an arithmetic number, because the mean of its divisors is an integer number (66798894240).
Almost surely, 22013104030223 is an apocalyptic number.
2013104030223 is a deficient number, since it is larger than the sum of its proper divisors (1193242893297).
2013104030223 is a wasteful number, since it uses less digits than its factorization.
2013104030223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4055920 (or 4055907 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 2013104030223 its reverse (3220304013102), we get a palindrome (5233408043325).
The spelling of 2013104030223 in words is "two trillion, thirteen billion, one hundred four million, thirty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •