Base | Representation |
---|---|
bin | 11101010010110110010… |
… | …111111001101000101111 |
3 | 21010110011201010000110021 |
4 | 131102312113321220233 |
5 | 230440314212210411 |
6 | 4140450222023011 |
7 | 265304414115322 |
oct | 35226627715057 |
9 | 7113151100407 |
10 | 2013104413231 |
11 | 706830a6146a |
12 | 2861a0717a67 |
13 | 117ab1463542 |
14 | 6d6130387b9 |
15 | 375736a6a71 |
hex | 1d4b65f9a2f |
2013104413231 has 2 divisors, whose sum is σ = 2013104413232. Its totient is φ = 2013104413230.
The previous prime is 2013104413217. The next prime is 2013104413247. The reversal of 2013104413231 is 1323144013102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2013104413231 - 29 = 2013104412719 is a prime.
It is a super-2 number, since 2×20131044132312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2013104413196 and 2013104413205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2013104413291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006552206615 + 1006552206616.
It is an arithmetic number, because the mean of its divisors is an integer number (1006552206616).
Almost surely, 22013104413231 is an apocalyptic number.
2013104413231 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013104413231 is an equidigital number, since it uses as much as digits as its factorization.
2013104413231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 2013104413231 its reverse (1323144013102), we get a palindrome (3336248426333).
The spelling of 2013104413231 in words is "two trillion, thirteen billion, one hundred four million, four hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •