Base | Representation |
---|---|
bin | 101101101110110101001110… |
… | …101101110000000001110001 |
3 | 222101010212120111111212011111 |
4 | 231232311032231300001301 |
5 | 202330304421043323213 |
6 | 1551434000550513321 |
7 | 60236121265646500 |
oct | 5556651655600161 |
9 | 871125514455144 |
10 | 201130344120433 |
11 | 590a4999887122 |
12 | 1a6844a9365841 |
13 | 882c6828071b0 |
14 | 3794a91112837 |
15 | 183bcdd990a3d |
hex | b6ed4eb70071 |
201130344120433 has 96 divisors (see below), whose sum is σ = 259281231552000. Its totient is φ = 154567744321536.
The previous prime is 201130344120413. The next prime is 201130344120437. The reversal of 201130344120433 is 334021443031102.
It is not a de Polignac number, because 201130344120433 - 217 = 201130343989361 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201130344120395 and 201130344120404.
It is not an unprimeable number, because it can be changed into a prime (201130344120437) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 22226798893 + ... + 22226807941.
It is an arithmetic number, because the mean of its divisors is an integer number (2700846162000).
Almost surely, 2201130344120433 is an apocalyptic number.
It is an amenable number.
201130344120433 is a deficient number, since it is larger than the sum of its proper divisors (58150887431567).
201130344120433 is a wasteful number, since it uses less digits than its factorization.
201130344120433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14679 (or 14672 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 201130344120433 its reverse (334021443031102), we get a palindrome (535151787151535).
The spelling of 201130344120433 in words is "two hundred one trillion, one hundred thirty billion, three hundred forty-four million, one hundred twenty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •