Base | Representation |
---|---|
bin | 1001001100011111110110… |
… | …0000000111111110010001 |
3 | 1022210112110222000222012200 |
4 | 2103013331200013332101 |
5 | 2311121404120320101 |
6 | 33300340210513413 |
7 | 2062305635303544 |
oct | 223077540077621 |
9 | 38715428028180 |
10 | 10110311104401 |
11 | 3248839052502 |
12 | 1173542895869 |
13 | 584523c40671 |
14 | 26d4ad77685b |
15 | 127ed44de986 |
hex | 931fd807f91 |
10110311104401 has 24 divisors (see below), whose sum is σ = 14714882742144. Its totient is φ = 6688960585920.
The previous prime is 10110311104393. The next prime is 10110311104403. The reversal of 10110311104401 is 10440111301101.
10110311104401 is a `hidden beast` number, since 1 + 0 + 110 + 3 + 1 + 110 + 440 + 1 = 666.
It is not a de Polignac number, because 10110311104401 - 23 = 10110311104393 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10110311104403) 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 23 ways as a sum of consecutive naturals, for example, 2779740 + ... + 5286546.
It is an arithmetic number, because the mean of its divisors is an integer number (613120114256).
Almost surely, 210110311104401 is an apocalyptic number.
It is an amenable number.
10110311104401 is a deficient number, since it is larger than the sum of its proper divisors (4604571637743).
10110311104401 is a wasteful number, since it uses less digits than its factorization.
10110311104401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2510221 (or 2510218 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 10110311104401 its reverse (10440111301101), we get a palindrome (20550422405502).
The spelling of 10110311104401 in words is "ten trillion, one hundred ten billion, three hundred eleven million, one hundred four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •