Base | Representation |
---|---|
bin | 1001001101101110000111… |
… | …0000001111000001001111 |
3 | 1022212112201010201212110221 |
4 | 2103123201300033001033 |
5 | 2311442421010330444 |
6 | 33314133033012211 |
7 | 2063651364344206 |
oct | 223334160170117 |
9 | 38775633655427 |
10 | 10131320401999 |
11 | 325673a275775 |
12 | 1177626854067 |
13 | 5864c175c3c4 |
14 | 270503b0a23d |
15 | 128813b76a84 |
hex | 936e1c0f04f |
10131320401999 has 16 divisors (see below), whose sum is σ = 11098973833920. Its totient is φ = 9205072145920.
The previous prime is 10131320401919. The next prime is 10131320402003. The reversal of 10131320401999 is 99910402313101.
It is a cyclic number.
It is not a de Polignac number, because 10131320401999 - 241 = 7932297146447 is a prime.
It is a super-2 number, since 2×101313204019992 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10131320401919) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1415262 + ... + 4718644.
It is an arithmetic number, because the mean of its divisors is an integer number (693685864620).
Almost surely, 210131320401999 is an apocalyptic number.
10131320401999 is a deficient number, since it is larger than the sum of its proper divisors (967653431921).
10131320401999 is a wasteful number, since it uses less digits than its factorization.
10131320401999 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3309650.
The product of its (nonzero) digits is 52488, while the sum is 43.
The spelling of 10131320401999 in words is "ten trillion, one hundred thirty-one billion, three hundred twenty million, four hundred one thousand, nine hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •