Base | Representation |
---|---|
bin | 1001000111100000010000… |
… | …0110010110011100100011 |
3 | 1022111100001012112101221122 |
4 | 2101320010012112130203 |
5 | 2303220210221130111 |
6 | 33153111350042455 |
7 | 2053151003562662 |
oct | 221700406263443 |
9 | 38440035471848 |
10 | 10024522442531 |
11 | 3215415642053 |
12 | 115a9a034942b |
13 | 579401766a4c |
14 | 269291cc2dd9 |
15 | 125b62c31cdb |
hex | 91e04196723 |
10024522442531 has 16 divisors (see below), whose sum is σ = 10141765976160. Its totient is φ = 9907789086720.
The previous prime is 10024522442489. The next prime is 10024522442549. The reversal of 10024522442531 is 13524422542001.
It is not a de Polignac number, because 10024522442531 - 214 = 10024522426147 is a prime.
It is a super-2 number, since 2×100245224425312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10024522442491 and 10024522442500.
It is not an unprimeable number, because it can be changed into a prime (10024522442591) 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, 277201091 + ... + 277237251.
It is an arithmetic number, because the mean of its divisors is an integer number (633860373510).
Almost surely, 210024522442531 is an apocalyptic number.
10024522442531 is a deficient number, since it is larger than the sum of its proper divisors (117243533629).
10024522442531 is a wasteful number, since it uses less digits than its factorization.
10024522442531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43126.
The product of its (nonzero) digits is 76800, while the sum is 35.
Adding to 10024522442531 its reverse (13524422542001), we get a palindrome (23548944984532).
The spelling of 10024522442531 in words is "ten trillion, twenty-four billion, five hundred twenty-two million, four hundred forty-two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •