Base | Representation |
---|---|
bin | 11101100110101100000011… |
… | …111110001001100110010101 |
3 | 122002000012010021000202202201 |
4 | 131212230003332021212111 |
5 | 114031212144022432013 |
6 | 1140525550111204501 |
7 | 36265532641121536 |
oct | 3546540376114625 |
9 | 562005107022681 |
10 | 130202000202133 |
11 | 385393a3833942 |
12 | 1272a02a516731 |
13 | 5785cc40bc702 |
14 | 2421b4bb8c68d |
15 | 100bcbd4203dd |
hex | 766b03f89995 |
130202000202133 has 16 divisors (see below), whose sum is σ = 131022781344000. Its totient is φ = 129383955146880.
The previous prime is 130202000202101. The next prime is 130202000202143. The reversal of 130202000202133 is 331202000202031.
It is a cyclic number.
It is not a de Polignac number, because 130202000202133 - 25 = 130202000202101 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130202000202133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130202000202143) 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, 520102288 + ... + 520352566.
It is an arithmetic number, because the mean of its divisors is an integer number (8188923834000).
Almost surely, 2130202000202133 is an apocalyptic number.
It is an amenable number.
130202000202133 is a deficient number, since it is larger than the sum of its proper divisors (820781141867).
130202000202133 is a wasteful number, since it uses less digits than its factorization.
130202000202133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255732.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 130202000202133 its reverse (331202000202031), we get a palindrome (461404000404164).
The spelling of 130202000202133 in words is "one hundred thirty trillion, two hundred two billion, two hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •