Base | Representation |
---|---|
bin | 11110101011101011110… |
… | …01110000011111111011 |
3 | 10201210012011002010022112 |
4 | 33111311321300133323 |
5 | 114233043214001101 |
6 | 2124151414242535 |
7 | 136111114114514 |
oct | 17256571603773 |
9 | 3653164063275 |
10 | 1054245062651 |
11 | 377114943390 |
12 | 1503a065644b |
13 | 78551661251 |
14 | 3905087da0b |
15 | 1c653b3c6bb |
hex | f575e707fb |
1054245062651 has 32 divisors (see below), whose sum is σ = 1194770497536. Its totient is φ = 921837888000.
The previous prime is 1054245062603. The next prime is 1054245062653. The reversal of 1054245062651 is 1562605424501.
It is a cyclic number.
It is not a de Polignac number, because 1054245062651 - 26 = 1054245062587 is a prime.
It is a super-2 number, since 2×10542450626512 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (41).
It is a junction number, because it is equal to n+sod(n) for n = 1054245062599 and 1054245062608.
It is not an unprimeable number, because it can be changed into a prime (1054245062653) 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, 104262086 + ... + 104272196.
It is an arithmetic number, because the mean of its divisors is an integer number (37336578048).
Almost surely, 21054245062651 is an apocalyptic number.
1054245062651 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1054245062651 is a deficient number, since it is larger than the sum of its proper divisors (140525434885).
1054245062651 is a wasteful number, since it uses less digits than its factorization.
1054245062651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13403.
The product of its (nonzero) digits is 288000, while the sum is 41.
The spelling of 1054245062651 in words is "one trillion, fifty-four billion, two hundred forty-five million, sixty-two thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •