Base | Representation |
---|---|
bin | 1001001101000101000110… |
… | …0100010100010010000101 |
3 | 1022211111021220101211220222 |
4 | 2103101101210110102011 |
5 | 2311302344211033013 |
6 | 33305112404234125 |
7 | 2063111515516631 |
oct | 223212144242205 |
9 | 38744256354828 |
10 | 10120311424133 |
11 | 3251aaaa65759 |
12 | 117547399b945 |
13 | 585458a10511 |
14 | 26db7b97ddc1 |
15 | 1283bc412508 |
hex | 93451914485 |
10120311424133 has 32 divisors (see below), whose sum is σ = 10851658481664. Its totient is φ = 9431267454000.
The previous prime is 10120311424127. The next prime is 10120311424177. The reversal of 10120311424133 is 33142411302101.
It is not a de Polignac number, because 10120311424133 - 214 = 10120311407749 is a prime.
It is a super-2 number, since 2×101203114241332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10120311424193) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 90896288 + ... + 91007558.
It is an arithmetic number, because the mean of its divisors is an integer number (339114327552).
Almost surely, 210120311424133 is an apocalyptic number.
It is an amenable number.
10120311424133 is a deficient number, since it is larger than the sum of its proper divisors (731347057531).
10120311424133 is an frugal number, since it uses more digits than its factorization.
10120311424133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 111478 (or 111416 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 10120311424133 its reverse (33142411302101), we get a palindrome (43262722726234).
The spelling of 10120311424133 in words is "ten trillion, one hundred twenty billion, three hundred eleven million, four hundred twenty-four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •