Base | Representation |
---|---|
bin | 1001001110001110111100… |
… | …0010000001100111100101 |
3 | 1022220101110022101112002002 |
4 | 2103203233002001213211 |
5 | 2312113443033312401 |
6 | 33322151323455045 |
7 | 2064412644153230 |
oct | 223435702014745 |
9 | 38811408345062 |
10 | 10140133104101 |
11 | 325a45186a250 |
12 | 1179286087485 |
13 | 587297481b30 |
14 | 270adc2c8417 |
15 | 128b7c6a7a6b |
hex | 938ef0819e5 |
10140133104101 has 16 divisors (see below), whose sum is σ = 13614724169088. Its totient is φ = 7293602232000.
The previous prime is 10140133104037. The next prime is 10140133104103.
10140133104101 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 10140133104101 - 26 = 10140133104037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140133104103) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5065000550 + ... + 5065002551.
It is an arithmetic number, because the mean of its divisors is an integer number (850920260568).
Almost surely, 210140133104101 is an apocalyptic number.
10140133104101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10140133104101 is a deficient number, since it is larger than the sum of its proper divisors (3474591064987).
10140133104101 is a wasteful number, since it uses less digits than its factorization.
10140133104101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10130003132.
The product of its (nonzero) digits is 144, while the sum is 20.
It can be divided in two parts, 1014013 and 3104101, that added together give a palindrome (4118114).
The spelling of 10140133104101 in words is "ten trillion, one hundred forty billion, one hundred thirty-three million, one hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •