Base | Representation |
---|---|
bin | 1011111011010101110101… |
… | …0101010100000110010001 |
3 | 1201102200210020201001202210 |
4 | 2332311131111110012101 |
5 | 3204330134330214441 |
6 | 43520311305302333 |
7 | 2522314435321440 |
oct | 276653525240621 |
9 | 51380706631683 |
10 | 13114101023121 |
11 | 41a672816420a |
12 | 1579725a949a9 |
13 | 7418679b8107 |
14 | 334a23b38d57 |
15 | 17b1db80c616 |
hex | bed5d554191 |
13114101023121 has 16 divisors (see below), whose sum is σ = 20054004737024. Its totient is φ = 7467292250064.
The previous prime is 13114101023083. The next prime is 13114101023129. The reversal of 13114101023121 is 12132010141131.
It is a happy number.
It is not a de Polignac number, because 13114101023121 - 221 = 13114098925969 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 (13114101023129) 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 15 ways as a sum of consecutive naturals, for example, 1103317381 + ... + 1103329266.
It is an arithmetic number, because the mean of its divisors is an integer number (1253375296064).
Almost surely, 213114101023121 is an apocalyptic number.
It is an amenable number.
13114101023121 is a deficient number, since it is larger than the sum of its proper divisors (6939903713903).
13114101023121 is a wasteful number, since it uses less digits than its factorization.
13114101023121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2206646940.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 13114101023121 its reverse (12132010141131), we get a palindrome (25246111164252).
The spelling of 13114101023121 in words is "thirteen trillion, one hundred fourteen billion, one hundred one million, twenty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •