Base | Representation |
---|---|
bin | 111001010011011101111010… |
… | …111100110000101011111111 |
3 | 1020001100111022112112212112222 |
4 | 321103131322330300223333 |
5 | 231013200131332213044 |
6 | 2252003204023315555 |
7 | 104041211225624606 |
oct | 7123357274605377 |
9 | 1201314275485488 |
10 | 252026448710399 |
11 | 733378a8a87870 |
12 | 243244b78abbbb |
13 | aa81cb89545cc |
14 | 4634206616a3d |
15 | 1e20bbdb668ee |
hex | e5377af30aff |
252026448710399 has 16 divisors (see below), whose sum is σ = 276580095246720. Its totient is φ = 227747000888160.
The previous prime is 252026448710389. The next prime is 252026448710537. The reversal of 252026448710399 is 993017844620252.
It is a cyclic number.
It is not a de Polignac number, because 252026448710399 - 24 = 252026448710383 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (252026448710389) 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, 2721509 + ... + 22615470.
It is an arithmetic number, because the mean of its divisors is an integer number (17286255952920).
It is a 1-persistent number, because it is pandigital, but 2⋅252026448710399 = 504052897420798 is not.
Almost surely, 2252026448710399 is an apocalyptic number.
252026448710399 is a deficient number, since it is larger than the sum of its proper divisors (24553646536321).
252026448710399 is a wasteful number, since it uses less digits than its factorization.
252026448710399 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25342390.
The product of its (nonzero) digits is 52254720, while the sum is 62.
The spelling of 252026448710399 in words is "two hundred fifty-two trillion, twenty-six billion, four hundred forty-eight million, seven hundred ten thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •