Base | Representation |
---|---|
bin | 1001001101101110011100… |
… | …1110000010100010111110 |
3 | 1022212112221112021200021201 |
4 | 2103123213032002202332 |
5 | 2311443112444220220 |
6 | 33314150110250114 |
7 | 2063653556645143 |
oct | 223334716024276 |
9 | 38775845250251 |
10 | 10131412101310 |
11 | 3256787007825 |
12 | 11776514b693a |
13 | 586507757956 |
14 | 270511d7a3ca |
15 | 12881bc3bd0a |
hex | 936e73828be |
10131412101310 has 8 divisors (see below), whose sum is σ = 18236541782376. Its totient is φ = 4052564840520.
The previous prime is 10131412101301. The next prime is 10131412101367. The reversal of 10131412101310 is 1310121413101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101314121013102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 506570605056 + ... + 506570605075.
It is an arithmetic number, because the mean of its divisors is an integer number (2279567722797).
Almost surely, 210131412101310 is an apocalyptic number.
10131412101310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10131412101310 is a deficient number, since it is larger than the sum of its proper divisors (8105129681066).
10131412101310 is a wasteful number, since it uses less digits than its factorization.
10131412101310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1013141210138.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 10131412101310 its reverse (1310121413101), we get a palindrome (11441533514411).
The spelling of 10131412101310 in words is "ten trillion, one hundred thirty-one billion, four hundred twelve million, one hundred one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •