Base | Representation |
---|---|
bin | 11110010101101011100111… |
… | …110111111101001101111101 |
3 | 122111102220121210112110000122 |
4 | 132111223213313331031331 |
5 | 114442114343110114401 |
6 | 1151441302513104325 |
7 | 40051045045313321 |
oct | 3625534767751575 |
9 | 574386553473018 |
10 | 133431344223101 |
11 | 39573a082a2011 |
12 | 12b6ba7b2580a5 |
13 | 595b6a24382a2 |
14 | 24d417c015981 |
15 | 1065cc733821b |
hex | 795ae7dfd37d |
133431344223101 has 8 divisors (see below), whose sum is σ = 135094102244640. Its totient is φ = 131776561060848.
The previous prime is 133431344223059. The next prime is 133431344223157. The reversal of 133431344223101 is 101322443134331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133431344223101 - 234 = 133414164353917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133431344223301) 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, 1993681151 + ... + 1993748076.
It is an arithmetic number, because the mean of its divisors is an integer number (16886762780580).
Almost surely, 2133431344223101 is an apocalyptic number.
It is an amenable number.
133431344223101 is a deficient number, since it is larger than the sum of its proper divisors (1662758021539).
133431344223101 is a wasteful number, since it uses less digits than its factorization.
133431344223101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3987429643.
The product of its (nonzero) digits is 62208, while the sum is 35.
Adding to 133431344223101 its reverse (101322443134331), we get a palindrome (234753787357432).
The spelling of 133431344223101 in words is "one hundred thirty-three trillion, four hundred thirty-one billion, three hundred forty-four million, two hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •