Base | Representation |
---|---|
bin | 1001011000001000010010… |
… | …0100011000111010100111 |
3 | 1100111122021202222022011121 |
4 | 2112002010210120322213 |
5 | 2322410134241022101 |
6 | 33532225430314411 |
7 | 2112612006661405 |
oct | 226020444307247 |
9 | 40448252868147 |
10 | 10310145642151 |
11 | 3315565480443 |
12 | 11a6212ab8a07 |
13 | 59a31cba8a84 |
14 | 2790298a6475 |
15 | 12d2cd17d0a1 |
hex | 96084918ea7 |
10310145642151 has 8 divisors (see below), whose sum is σ = 10589325770624. Its totient is φ = 10030993279200.
The previous prime is 10310145642149. The next prime is 10310145642161. The reversal of 10310145642151 is 15124654101301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10310145642151 - 21 = 10310145642149 is a prime.
It is a super-2 number, since 2×103101456421512 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310145642101) 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, 6187575 + ... + 7675048.
It is an arithmetic number, because the mean of its divisors is an integer number (1323665721328).
Almost surely, 210310145642151 is an apocalyptic number.
10310145642151 is a deficient number, since it is larger than the sum of its proper divisors (279180128473).
10310145642151 is a wasteful number, since it uses less digits than its factorization.
10310145642151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13882761.
The product of its (nonzero) digits is 14400, while the sum is 34.
Adding to 10310145642151 its reverse (15124654101301), we get a palindrome (25434799743452).
The spelling of 10310145642151 in words is "ten trillion, three hundred ten billion, one hundred forty-five million, six hundred forty-two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •