Base | Representation |
---|---|
bin | 1001001100010000010001… |
… | …0011101010110101011100 |
3 | 1022210010200121010201221200 |
4 | 2103010010103222311130 |
5 | 2311034323330000130 |
6 | 33254405301555500 |
7 | 2062100221203153 |
oct | 223040423526534 |
9 | 38703617121850 |
10 | 10106130312540 |
11 | 3246a93105719 |
12 | 1172776715b90 |
13 | 584008a2b822 |
14 | 26d1d440059a |
15 | 127d3c456760 |
hex | 931044ead5c |
10106130312540 has 72 divisors (see below), whose sum is σ = 30658109183520. Its totient is φ = 2694717777024.
The previous prime is 10106130312503. The next prime is 10106130312557. The reversal of 10106130312540 is 4521303160101.
It is a happy number.
10106130312540 is a `hidden beast` number, since 1 + 0 + 1 + 0 + 61 + 30 + 31 + 2 + 540 = 666.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 659944 + ... + 4543983.
Almost surely, 210106130312540 is an apocalyptic number.
10106130312540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10106130312540 is an abundant number, since it is smaller than the sum of its proper divisors (20551978870980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10106130312540 is a wasteful number, since it uses less digits than its factorization.
10106130312540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5214731 (or 5214726 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 10106130312540 its reverse (4521303160101), we get a palindrome (14627433472641).
The spelling of 10106130312540 in words is "ten trillion, one hundred six billion, one hundred thirty million, three hundred twelve thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •