Base | Representation |
---|---|
bin | 11010100010111110011… |
… | …00001100101110100011 |
3 | 10020012100220201000102011 |
4 | 31101133030030232203 |
5 | 104421020301201011 |
6 | 1535005441333351 |
7 | 122620301632645 |
oct | 15213714145643 |
9 | 3205326630364 |
10 | 912130100131 |
11 | 321917731638 |
12 | 12893a637257 |
13 | 68023872b53 |
14 | 3220c3cc895 |
15 | 18ad73ea621 |
hex | d45f30cba3 |
912130100131 has 4 divisors (see below), whose sum is σ = 912701253952. Its totient is φ = 911558946312.
The previous prime is 912130100093. The next prime is 912130100159. The reversal of 912130100131 is 131001031219.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131001031219 = 43319 ⋅3024101.
It is a cyclic number.
It is not a de Polignac number, because 912130100131 - 229 = 911593229219 is a prime.
It is a super-2 number, since 2×9121301001312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (912130106131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 285574515 + ... + 285577708.
It is an arithmetic number, because the mean of its divisors is an integer number (228175313488).
Almost surely, 2912130100131 is an apocalyptic number.
912130100131 is a deficient number, since it is larger than the sum of its proper divisors (571153821).
912130100131 is a wasteful number, since it uses less digits than its factorization.
912130100131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571153820.
The product of its (nonzero) digits is 162, while the sum is 22.
The spelling of 912130100131 in words is "nine hundred twelve billion, one hundred thirty million, one hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •