Base | Representation |
---|---|
bin | 1011111011110000101100… |
… | …1001110001100110100011 |
3 | 1201110101101210210212022112 |
4 | 2332330023021301212203 |
5 | 3204434421410413443 |
6 | 43523503030025535 |
7 | 2522661230322140 |
oct | 276741311614643 |
9 | 51411353725275 |
10 | 13121312201123 |
11 | 41a9798735a55 |
12 | 157abb8aa82ab |
13 | 742446990149 |
14 | 3351097473c7 |
15 | 17b4ae93cb18 |
hex | bef0b2719a3 |
13121312201123 has 8 divisors (see below), whose sum is σ = 14995809627648. Its totient is φ = 11246820838344.
The previous prime is 13121312201087. The next prime is 13121312201161. The reversal of 13121312201123 is 32110221312131.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13121312201123 is a prime.
It is a super-2 number, since 2×131213122011232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13121312201923) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4972340 + ... + 7139102.
It is an arithmetic number, because the mean of its divisors is an integer number (1874476203456).
Almost surely, 213121312201123 is an apocalyptic number.
13121312201123 is a deficient number, since it is larger than the sum of its proper divisors (1874497426525).
13121312201123 is an equidigital number, since it uses as much as digits as its factorization.
13121312201123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3031873.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 13121312201123 its reverse (32110221312131), we get a palindrome (45231533513254).
The spelling of 13121312201123 in words is "thirteen trillion, one hundred twenty-one billion, three hundred twelve million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.036 sec. • engine limits •