Base | Representation |
---|---|
bin | 1110010011011001101… |
… | …0000011101101000011 |
3 | 212111021001200221011022 |
4 | 3210312122003231003 |
5 | 13011221314431301 |
6 | 304515051340055 |
7 | 23516213666042 |
oct | 3446632035503 |
9 | 774231627138 |
10 | 245725936451 |
11 | 95236981026 |
12 | 3b75915162b |
13 | 1a230750bc8 |
14 | bc70d1a559 |
15 | 65d29a9d1b |
hex | 3936683b43 |
245725936451 has 2 divisors, whose sum is σ = 245725936452. Its totient is φ = 245725936450.
The previous prime is 245725936447. The next prime is 245725936481. The reversal of 245725936451 is 154639527542.
It is a happy number.
245725936451 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 245725936451 - 22 = 245725936447 is a prime.
It is a super-4 number, since 4×2457259364514 (a number of 47 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 245725936393 and 245725936402.
It is not a weakly prime, because it can be changed into another prime (245725936481) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 122862968225 + 122862968226.
It is an arithmetic number, because the mean of its divisors is an integer number (122862968226).
Almost surely, 2245725936451 is an apocalyptic number.
245725936451 is a deficient number, since it is larger than the sum of its proper divisors (1).
245725936451 is an equidigital number, since it uses as much as digits as its factorization.
245725936451 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9072000, while the sum is 53.
The spelling of 245725936451 in words is "two hundred forty-five billion, seven hundred twenty-five million, nine hundred thirty-six thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •