Base | Representation |
---|---|
bin | 111100011100010010111… |
… | …011101100100001110101 |
3 | 112201002001010000102020221 |
4 | 330130102323230201311 |
5 | 1021022433024422010 |
6 | 12500040501054341 |
7 | 606040603043641 |
oct | 74342273544165 |
9 | 15632033012227 |
10 | 4153551014005 |
11 | 13615692a0138 |
12 | 570b9b9b73b1 |
13 | 2418a7c662c3 |
14 | 10506656bc21 |
15 | 7309b6c1dda |
hex | 3c712eec875 |
4153551014005 has 16 divisors (see below), whose sum is σ = 5004246386304. Its totient is φ = 3309522587200.
The previous prime is 4153551014003. The next prime is 4153551014083. The reversal of 4153551014005 is 5004101553514.
It is not a de Polignac number, because 4153551014005 - 21 = 4153551014003 is a prime.
It is a super-2 number, since 2×41535510140052 (a number of 26 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 (4153551014003) 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, 6089430 + ... + 6737080.
It is an arithmetic number, because the mean of its divisors is an integer number (312765399144).
Almost surely, 24153551014005 is an apocalyptic number.
It is an amenable number.
4153551014005 is a deficient number, since it is larger than the sum of its proper divisors (850695372299).
4153551014005 is a wasteful number, since it uses less digits than its factorization.
4153551014005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 652796.
The product of its (nonzero) digits is 30000, while the sum is 34.
Adding to 4153551014005 its reverse (5004101553514), we get a palindrome (9157652567519).
The spelling of 4153551014005 in words is "four trillion, one hundred fifty-three billion, five hundred fifty-one million, fourteen thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •