Base | Representation |
---|---|
bin | 111001100111011101101001… |
… | …110110100111110010101111 |
3 | 1020020012212010010020011111212 |
4 | 321213131221312213302233 |
5 | 231203203312131020101 |
6 | 2254534334541305035 |
7 | 104242404614153516 |
oct | 7147355166476257 |
9 | 1206185103204455 |
10 | 253400551423151 |
11 | 73817630159920 |
12 | 24506883b6517b |
13 | ab5175316b272 |
14 | 468091b62767d |
15 | 1e467e34611bb |
hex | e67769da7caf |
253400551423151 has 16 divisors (see below), whose sum is σ = 277093102387200. Its totient is φ = 229817456820000.
The previous prime is 253400551423139. The next prime is 253400551423157. The reversal of 253400551423151 is 151324155004352.
It is a cyclic number.
It is not a de Polignac number, because 253400551423151 - 238 = 253125673516207 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 253400551423099 and 253400551423108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (253400551423157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48210770 + ... + 53207888.
It is an arithmetic number, because the mean of its divisors is an integer number (17318318899200).
Almost surely, 2253400551423151 is an apocalyptic number.
253400551423151 is a deficient number, since it is larger than the sum of its proper divisors (23692550964049).
253400551423151 is a wasteful number, since it uses less digits than its factorization.
253400551423151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5008070.
The product of its (nonzero) digits is 360000, while the sum is 41.
The spelling of 253400551423151 in words is "two hundred fifty-three trillion, four hundred billion, five hundred fifty-one million, four hundred twenty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •