Base | Representation |
---|---|
bin | 1001001101101101011001… |
… | …1101101110101000111010 |
3 | 1022212112012221100022201000 |
4 | 2103123112131232220322 |
5 | 2311442024014021102 |
6 | 33314102145305430 |
7 | 2063643604433655 |
oct | 223332635565072 |
9 | 38775187308630 |
10 | 10131131001402 |
11 | 3256652372254 |
12 | 1177593335276 |
13 | 586491446748 |
14 | 2704c68c689c |
15 | 12880221301c |
hex | 936d676ea3a |
10131131001402 has 64 divisors (see below), whose sum is σ = 22842269573760. Its totient is φ = 3327951889152.
The previous prime is 10131131001367. The next prime is 10131131001419. The reversal of 10131131001402 is 20410013113101.
It is a happy number.
10131131001402 is a `hidden beast` number, since 1 + 0 + 1 + 311 + 310 + 0 + 1 + 40 + 2 = 666.
It is a super-3 number, since 3×101311310014023 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1067503 + ... + 4626210.
It is an arithmetic number, because the mean of its divisors is an integer number (356910462090).
Almost surely, 210131131001402 is an apocalyptic number.
10131131001402 is an abundant number, since it is smaller than the sum of its proper divisors (12711138572358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131131001402 is a wasteful number, since it uses less digits than its factorization.
10131131001402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5694204 (or 5694198 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 10131131001402 its reverse (20410013113101), we get a palindrome (30541144114503).
The spelling of 10131131001402 in words is "ten trillion, one hundred thirty-one billion, one hundred thirty-one million, one thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •