Base | Representation |
---|---|
bin | 1001001101110001000011… |
… | …1100011110111111101011 |
3 | 1022212121202022112110000100 |
4 | 2103130100330132333223 |
5 | 2312001031202023230 |
6 | 33314343354440443 |
7 | 2064010120130052 |
oct | 223342074367753 |
9 | 38777668473010 |
10 | 10132112142315 |
11 | 3257006184a09 |
12 | 1177807a33123 |
13 | 5865b97ac8b7 |
14 | 27057ad25399 |
15 | 12885d41b660 |
hex | 93710f1efeb |
10132112142315 has 24 divisors (see below), whose sum is σ = 17563163314320. Its totient is φ = 5403536034624.
The previous prime is 10132112142311. The next prime is 10132112142323. The reversal of 10132112142315 is 51324121123101.
10132112142315 is a `hidden beast` number, since 1 + 0 + 1 + 3 + 211 + 21 + 423 + 1 + 5 = 666.
It is not a de Polignac number, because 10132112142315 - 22 = 10132112142311 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10132112142311) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4398232 + ... + 6293541.
It is an arithmetic number, because the mean of its divisors is an integer number (731798471430).
Almost surely, 210132112142315 is an apocalyptic number.
10132112142315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10132112142315 is a deficient number, since it is larger than the sum of its proper divisors (7431051172005).
10132112142315 is a wasteful number, since it uses less digits than its factorization.
10132112142315 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10712843 (or 10712840 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
Adding to 10132112142315 its reverse (51324121123101), we get a palindrome (61456233265416).
The spelling of 10132112142315 in words is "ten trillion, one hundred thirty-two billion, one hundred twelve million, one hundred forty-two thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •