Base | Representation |
---|---|
bin | 1001001101110100101111… |
… | …0110011110101111001111 |
3 | 1022212201022012011100211000 |
4 | 2103131023312132233033 |
5 | 2312010042202033033 |
6 | 33315025421031343 |
7 | 2064043450314144 |
oct | 223351366365717 |
9 | 38781265140730 |
10 | 10133100424143 |
11 | 3257473024754 |
12 | 1177a429b5553 |
13 | 586716476148 |
14 | 2706322a23cb |
15 | 1288ba085a13 |
hex | 9374bd9ebcf |
10133100424143 has 16 divisors (see below), whose sum is σ = 15030153020160. Its totient is φ = 6747231706488.
The previous prime is 10133100424049. The next prime is 10133100424189. The reversal of 10133100424143 is 34142400133101.
10133100424143 is a `hidden beast` number, since 1 + 0 + 133 + 100 + 424 + 1 + 4 + 3 = 666.
It is not a de Polignac number, because 10133100424143 - 213 = 10133100415951 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10133100424243) 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, 226882155 + ... + 226926812.
It is an arithmetic number, because the mean of its divisors is an integer number (939384563760).
Almost surely, 210133100424143 is an apocalyptic number.
10133100424143 is a deficient number, since it is larger than the sum of its proper divisors (4897052596017).
10133100424143 is an equidigital number, since it uses as much as digits as its factorization.
10133100424143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 453809803 (or 453809797 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 10133100424143 its reverse (34142400133101), we get a palindrome (44275500557244).
The spelling of 10133100424143 in words is "ten trillion, one hundred thirty-three billion, one hundred million, four hundred twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •