Base | Representation |
---|---|
bin | 11111010101100011101… |
… | …100011100010100011101 |
3 | 21121212102201100222221201 |
4 | 133111203230130110131 |
5 | 240240232002210023 |
6 | 4325140512555501 |
7 | 311403346161055 |
oct | 37254354342435 |
9 | 7555381328851 |
10 | 2153451210013 |
11 | 760301082114 |
12 | 2a942a552b91 |
13 | 1280b9b2971c |
14 | 7632873c565 |
15 | 3b039a7cbad |
hex | 1f563b1c51d |
2153451210013 has 16 divisors (see below), whose sum is σ = 2284983216000. Its totient is φ = 2022460070400.
The previous prime is 2153451209929. The next prime is 2153451210041. The reversal of 2153451210013 is 3100121543512.
It is a cyclic number.
It is not a de Polignac number, because 2153451210013 - 233 = 2144861275421 is a prime.
It is a super-2 number, since 2×21534512100132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2153451210073) 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 15 ways as a sum of consecutive naturals, for example, 119355273 + ... + 119373313.
It is an arithmetic number, because the mean of its divisors is an integer number (142811451000).
Almost surely, 22153451210013 is an apocalyptic number.
It is an amenable number.
2153451210013 is a deficient number, since it is larger than the sum of its proper divisors (131532005987).
2153451210013 is a wasteful number, since it uses less digits than its factorization.
2153451210013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32628.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 2153451210013 its reverse (3100121543512), we get a palindrome (5253572753525).
The spelling of 2153451210013 in words is "two trillion, one hundred fifty-three billion, four hundred fifty-one million, two hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •