Base | Representation |
---|---|
bin | 101101110001010101011001… |
… | …011101100111101011001100 |
3 | 222101202022111000100220100102 |
4 | 231301111121131213223030 |
5 | 202341114124210230012 |
6 | 1552045002141550232 |
7 | 60254420140306124 |
oct | 5561253135475314 |
9 | 871668430326312 |
10 | 201302323133132 |
11 | 59160921516881 |
12 | 1a6b18a4875378 |
13 | 884295c76a9c0 |
14 | 379d12793dc84 |
15 | 1841506e052c2 |
hex | b71559767acc |
201302323133132 has 48 divisors (see below), whose sum is σ = 379501467727200. Its totient is φ = 92878398047232.
The previous prime is 201302323133129. The next prime is 201302323133173. The reversal of 201302323133132 is 231331323203102.
It is a super-2 number, since 2×2013023231331322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 201302323133095 and 201302323133104.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3175234058 + ... + 3175297454.
It is an arithmetic number, because the mean of its divisors is an integer number (7906280577650).
Almost surely, 2201302323133132 is an apocalyptic number.
It is an amenable number.
201302323133132 is a deficient number, since it is larger than the sum of its proper divisors (178199144594068).
201302323133132 is a wasteful number, since it uses less digits than its factorization.
201302323133132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82410 (or 82408 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 201302323133132 its reverse (231331323203102), we get a palindrome (432633646336234).
The spelling of 201302323133132 in words is "two hundred one trillion, three hundred two billion, three hundred twenty-three million, one hundred thirty-three thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •