Base | Representation |
---|---|
bin | 1001001100101110110011… |
… | …0001111110110100100011 |
3 | 1022210220211201220102202111 |
4 | 2103023230301332310203 |
5 | 2311203114314241011 |
6 | 33302242414100151 |
7 | 2062510262403031 |
oct | 223135461766443 |
9 | 38726751812674 |
10 | 10114325540131 |
11 | 324a5090a648a |
12 | 11742831aa657 |
13 | 584a13847917 |
14 | 26d7709a7551 |
15 | 12816bb67121 |
hex | 932ecc7ed23 |
10114325540131 has 16 divisors (see below), whose sum is σ = 10338204457728. Its totient is φ = 9892888524000.
The previous prime is 10114325539991. The next prime is 10114325540149. The reversal of 10114325540131 is 13104552341101.
It is a happy number.
It is not a de Polignac number, because 10114325540131 - 213 = 10114325531939 is a prime.
It is a super-2 number, since 2×101143255401312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10114325540093 and 10114325540102.
It is not an unprimeable number, because it can be changed into a prime (10114325570131) 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, 176576026 + ... + 176633296.
It is an arithmetic number, because the mean of its divisors is an integer number (646137778608).
Almost surely, 210114325540131 is an apocalyptic number.
10114325540131 is a deficient number, since it is larger than the sum of its proper divisors (223878917597).
10114325540131 is a wasteful number, since it uses less digits than its factorization.
10114325540131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78522.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 10114325540131 its reverse (13104552341101), we get a palindrome (23218877881232).
The spelling of 10114325540131 in words is "ten trillion, one hundred fourteen billion, three hundred twenty-five million, five hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •