Base | Representation |
---|---|
bin | 10101001001101000100… |
… | …111110110111001101001 |
3 | 12010221121201112210000000 |
4 | 111021220213312321221 |
5 | 142303133240200001 |
6 | 3031412504133213 |
7 | 210002644032432 |
oct | 25115047667151 |
9 | 5127551483000 |
10 | 1453454225001 |
11 | 510452022749 |
12 | 1b5832a67209 |
13 | a70a21a6bcc |
14 | 504c19c0489 |
15 | 27c1adbda86 |
hex | 152689f6e69 |
1453454225001 has 32 divisors (see below), whose sum is σ = 2308075516800. Its totient is φ = 911971255104.
The previous prime is 1453454224987. The next prime is 1453454225059. The reversal of 1453454225001 is 1005224543541.
1453454225001 is a `hidden beast` number, since 1 + 4 + 534 + 54 + 22 + 50 + 0 + 1 = 666.
It is a de Polignac number, because none of the positive numbers 2k-1453454225001 is a prime.
It is a super-2 number, since 2×14534542250012 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1453454229001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19509531 + ... + 19583888.
It is an arithmetic number, because the mean of its divisors is an integer number (72127359900).
Almost surely, 21453454225001 is an apocalyptic number.
It is an amenable number.
1453454225001 is a deficient number, since it is larger than the sum of its proper divisors (854621291799).
1453454225001 is an frugal number, since it uses more digits than its factorization.
1453454225001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39093457 (or 39093439 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 36.
Adding to 1453454225001 its reverse (1005224543541), we get a palindrome (2458678768542).
The spelling of 1453454225001 in words is "one trillion, four hundred fifty-three billion, four hundred fifty-four million, two hundred twenty-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •