Base | Representation |
---|---|
bin | 11101100011111011001000… |
… | …010101000000111111111001 |
3 | 122001100000202021122110202202 |
4 | 131203323020111000333321 |
5 | 114020104104334032413 |
6 | 1140302410425435545 |
7 | 36246026036430266 |
oct | 3543731025007771 |
9 | 561300667573682 |
10 | 130012021002233 |
11 | 384758744a4117 |
12 | 126b924a93bbb5 |
13 | 5771108b91366 |
14 | 24168888c626d |
15 | 1006d9eab6e58 |
hex | 763ec8540ff9 |
130012021002233 has 4 divisors (see below), whose sum is σ = 130015771347600. Its totient is φ = 130008270656868.
The previous prime is 130012021002229. The next prime is 130012021002277. The reversal of 130012021002233 is 332200120210031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130012021002233 - 22 = 130012021002229 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130012021002223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1875120683 + ... + 1875190016.
It is an arithmetic number, because the mean of its divisors is an integer number (32503942836900).
Almost surely, 2130012021002233 is an apocalyptic number.
It is an amenable number.
130012021002233 is a deficient number, since it is larger than the sum of its proper divisors (3750345367).
130012021002233 is an equidigital number, since it uses as much as digits as its factorization.
130012021002233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3750345366.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 130012021002233 its reverse (332200120210031), we get a palindrome (462212141212264).
The spelling of 130012021002233 in words is "one hundred thirty trillion, twelve billion, twenty-one million, two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •