Base | Representation |
---|---|
bin | 1001100100100110011111… |
… | …0111011010101010000001 |
3 | 1101021010100101210012102101 |
4 | 2121021213313122222001 |
5 | 2334412444042034203 |
6 | 34214503123550401 |
7 | 2134235515563523 |
oct | 231114767325201 |
9 | 41233311705371 |
10 | 10524412455553 |
11 | 3398418507717 |
12 | 121b85052b401 |
13 | 5b45a8b85369 |
14 | 285554675a13 |
15 | 133b6dd8b41d |
hex | 99267ddaa81 |
10524412455553 has 16 divisors (see below), whose sum is σ = 10568026954240. Its totient is φ = 10480909469184.
The previous prime is 10524412455539. The next prime is 10524412455617. The reversal of 10524412455553 is 35555421442501.
It is a happy number.
10524412455553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10524412455553 - 25 = 10524412455521 is a prime.
It is a super-2 number, since 2×105244124555532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10524412155553) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 496587925 + ... + 496609117.
It is an arithmetic number, because the mean of its divisors is an integer number (660501684640).
Almost surely, 210524412455553 is an apocalyptic number.
It is an amenable number.
10524412455553 is a deficient number, since it is larger than the sum of its proper divisors (43614498687).
10524412455553 is a wasteful number, since it uses less digits than its factorization.
10524412455553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23728.
The product of its (nonzero) digits is 2400000, while the sum is 46.
The spelling of 10524412455553 in words is "ten trillion, five hundred twenty-four billion, four hundred twelve million, four hundred fifty-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •