Base | Representation |
---|---|
bin | 110011011010110100… |
… | …0101011111000111111 |
3 | 101120000110120121122020 |
4 | 1212311220223320333 |
5 | 3302120402232111 |
6 | 122421004251223 |
7 | 10656230316330 |
oct | 1466550537077 |
9 | 346013517566 |
10 | 110421524031 |
11 | 42914087385 |
12 | 19497b40b13 |
13 | a549936500 |
14 | 54b718c287 |
15 | 2d1410d906 |
hex | 19b5a2be3f |
110421524031 has 48 divisors (see below), whose sum is σ = 182455064064. Its totient is φ = 58162845312.
The previous prime is 110421524027. The next prime is 110421524033. The reversal of 110421524031 is 130425124011.
It is not a de Polignac number, because 110421524031 - 22 = 110421524027 is a prime.
It is a super-2 number, since 2×1104215240312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110421523992 and 110421524010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110421524033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2558725 + ... + 2601521.
It is an arithmetic number, because the mean of its divisors is an integer number (3801147168).
Almost surely, 2110421524031 is an apocalyptic number.
110421524031 is a deficient number, since it is larger than the sum of its proper divisors (72033540033).
110421524031 is a wasteful number, since it uses less digits than its factorization.
110421524031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43560 (or 43547 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 110421524031 its reverse (130425124011), we get a palindrome (240846648042).
The spelling of 110421524031 in words is "one hundred ten billion, four hundred twenty-one million, five hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •