Base | Representation |
---|---|
bin | 110011010001111001… |
… | …0000110001110100001 |
3 | 101112020120222021201020 |
4 | 1212203302012032201 |
5 | 3301012213020223 |
6 | 122331144400053 |
7 | 10645632365262 |
oct | 1464362061641 |
9 | 345216867636 |
10 | 110122001313 |
11 | 4277aaa9545 |
12 | 19413776029 |
13 | a4cc874a2c |
14 | 54894a0969 |
15 | 2ce7b961e3 |
hex | 19a3c863a1 |
110122001313 has 32 divisors (see below), whose sum is σ = 153778102272. Its totient is φ = 70010438400.
The previous prime is 110122001293. The next prime is 110122001321. The reversal of 110122001313 is 313100221011.
It is a happy number.
It is not a de Polignac number, because 110122001313 - 226 = 110054892449 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110122001292 and 110122001301.
It is not an unprimeable number, because it can be changed into a prime (110122001113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21041145 + ... + 21046377.
It is an arithmetic number, because the mean of its divisors is an integer number (4805565696).
Almost surely, 2110122001313 is an apocalyptic number.
It is an amenable number.
110122001313 is a deficient number, since it is larger than the sum of its proper divisors (43656100959).
110122001313 is a wasteful number, since it uses less digits than its factorization.
110122001313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8525.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 110122001313 its reverse (313100221011), we get a palindrome (423222222324).
The spelling of 110122001313 in words is "one hundred ten billion, one hundred twenty-two million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •