Base | Representation |
---|---|
bin | 100000110000111110001… |
… | …0011011101110111010101 |
3 | 120221111120112100111000010 |
4 | 1001201330103131313111 |
5 | 1042240034032012203 |
6 | 13324425140310433 |
7 | 643226525445432 |
oct | 101417423356725 |
9 | 16844515314003 |
10 | 4503211204053 |
11 | 148688a365211 |
12 | 6089043a2419 |
13 | 268860308943 |
14 | 117d56c26b89 |
15 | 7c2139a1303 |
hex | 4187c4dddd5 |
4503211204053 has 16 divisors (see below), whose sum is σ = 6358587082560. Its totient is φ = 2825049866496.
The previous prime is 4503211204031. The next prime is 4503211204061. The reversal of 4503211204053 is 3504021123054.
It is not a de Polignac number, because 4503211204053 - 214 = 4503211187669 is a prime.
It is a super-2 number, since 2×45032112040532 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 4503211204053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4503211404053) 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, 7430863 + ... + 8013996.
It is an arithmetic number, because the mean of its divisors is an integer number (397411692660).
Almost surely, 24503211204053 is an apocalyptic number.
It is an amenable number.
4503211204053 is a deficient number, since it is larger than the sum of its proper divisors (1855375878507).
4503211204053 is a wasteful number, since it uses less digits than its factorization.
4503211204053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15450596.
The product of its (nonzero) digits is 14400, while the sum is 30.
The spelling of 4503211204053 in words is "four trillion, five hundred three billion, two hundred eleven million, two hundred four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •