Base | Representation |
---|---|
bin | 101000111100110000110… |
… | …000100000001100110101 |
3 | 100222000111000002200020012 |
4 | 220330300300200030311 |
5 | 332101104012200203 |
6 | 5552424344550005 |
7 | 410210035640366 |
oct | 50746060401465 |
9 | 10860430080205 |
10 | 2814021600053 |
11 | 9954689171a4 |
12 | 395462182305 |
13 | 1754904433c1 |
14 | 9a2b1111b6d |
15 | 4d2ec26cbd8 |
hex | 28f30c20335 |
2814021600053 has 8 divisors (see below), whose sum is σ = 2853709278336. Its totient is φ = 2774335410000.
The previous prime is 2814021599999. The next prime is 2814021600067. The reversal of 2814021600053 is 3500061204182.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2814021600053 - 26 = 2814021599989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2814021599992 and 2814021600019.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2814021600073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3757175 + ... + 4443467.
It is an arithmetic number, because the mean of its divisors is an integer number (356713659792).
Almost surely, 22814021600053 is an apocalyptic number.
It is an amenable number.
2814021600053 is a deficient number, since it is larger than the sum of its proper divisors (39687678283).
2814021600053 is an equidigital number, since it uses as much as digits as its factorization.
2814021600053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 744115.
The product of its (nonzero) digits is 11520, while the sum is 32.
The spelling of 2814021600053 in words is "two trillion, eight hundred fourteen billion, twenty-one million, six hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •