Base | Representation |
---|---|
bin | 1001001101001100010000… |
… | …0011001110110110111001 |
3 | 1022211200020202112212102101 |
4 | 2103103010003032312321 |
5 | 2311320312411143001 |
6 | 33310031135503401 |
7 | 2063210230331254 |
oct | 223230403166671 |
9 | 38750222485371 |
10 | 10122232131001 |
11 | 32528a6174201 |
12 | 117590b087b61 |
13 | 5856a3914163 |
14 | 26dcc0ab809b |
15 | 128480d60a01 |
hex | 934c40cedb9 |
10122232131001 has 8 divisors (see below), whose sum is σ = 10139125035104. Its totient is φ = 10105351512480.
The previous prime is 10122232130971. The next prime is 10122232131059. The reversal of 10122232131001 is 10013123222101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10122232131001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10122232131001.
It is not an unprimeable number, because it can be changed into a prime (10122232131901) 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, 1421460 + ... + 4718581.
It is an arithmetic number, because the mean of its divisors is an integer number (1267390629388).
Almost surely, 210122232131001 is an apocalyptic number.
It is an amenable number.
10122232131001 is a deficient number, since it is larger than the sum of its proper divisors (16892904103).
10122232131001 is an equidigital number, since it uses as much as digits as its factorization.
10122232131001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6142791.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 10122232131001 its reverse (10013123222101), we get a palindrome (20135355353102).
The spelling of 10122232131001 in words is "ten trillion, one hundred twenty-two billion, two hundred thirty-two million, one hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •