Base | Representation |
---|---|
bin | 11101010010111100000… |
… | …101000100100010100011 |
3 | 21010110102101020110111212 |
4 | 131102330011010202203 |
5 | 230441013213443301 |
6 | 4140503521500335 |
7 | 265306655563403 |
oct | 35227405044243 |
9 | 7113371213455 |
10 | 2013200140451 |
11 | 70687aaa4775 |
12 | 2862087a16ab |
13 | 117ac823c276 |
14 | 6d621a36803 |
15 | 3757bcb54bb |
hex | 1d4bc1448a3 |
2013200140451 has 12 divisors (see below), whose sum is σ = 2159566515504. Its totient is φ = 1875975951600.
The previous prime is 2013200140439. The next prime is 2013200140463. The reversal of 2013200140451 is 1540410023102.
It is an interprime number because it is at equal distance from previous prime (2013200140439) and next prime (2013200140463).
It is a de Polignac number, because none of the positive numbers 2k-2013200140451 is a prime.
It is a super-2 number, since 2×20132001404512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2013200142451) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45688895 + ... + 45732936.
It is an arithmetic number, because the mean of its divisors is an integer number (179963876292).
Almost surely, 22013200140451 is an apocalyptic number.
2013200140451 is a deficient number, since it is larger than the sum of its proper divisors (146366375053).
2013200140451 is an equidigital number, since it uses as much as digits as its factorization.
2013200140451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91421930 (or 91421911 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
Adding to 2013200140451 its reverse (1540410023102), we get a palindrome (3553610163553).
The spelling of 2013200140451 in words is "two trillion, thirteen billion, two hundred million, one hundred forty thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •