Base | Representation |
---|---|
bin | 1011111011000111000000… |
… | …1111100000101000011001 |
3 | 1201102022112000220212101010 |
4 | 2332301300033200220121 |
5 | 3204244013031121101 |
6 | 43514412453044133 |
7 | 2522114035253220 |
oct | 276616017405031 |
9 | 51368460825333 |
10 | 13110123301401 |
11 | 41a4a76906a95 |
12 | 15789b5926649 |
13 | 741382896b19 |
14 | 334767743cb7 |
15 | 17b0574d82d6 |
hex | bec703e0a19 |
13110123301401 has 32 divisors (see below), whose sum is σ = 20623364374528. Its totient is φ = 7249274003520.
The previous prime is 13110123301349. The next prime is 13110123301453. The reversal of 13110123301401 is 10410332101131.
It is an interprime number because it is at equal distance from previous prime (13110123301349) and next prime (13110123301453).
It is not a de Polignac number, because 13110123301401 - 225 = 13110089746969 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13110123301481) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7664991 + ... + 9218043.
It is an arithmetic number, because the mean of its divisors is an integer number (644480136704).
Almost surely, 213110123301401 is an apocalyptic number.
It is an amenable number.
13110123301401 is a deficient number, since it is larger than the sum of its proper divisors (7513241073127).
13110123301401 is a wasteful number, since it uses less digits than its factorization.
13110123301401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1566061.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13110123301401 its reverse (10410332101131), we get a palindrome (23520455402532).
The spelling of 13110123301401 in words is "thirteen trillion, one hundred ten billion, one hundred twenty-three million, three hundred one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •