Base | Representation |
---|---|
bin | 111000110101111111101000… |
… | …0110100001011001010111011 |
3 | 2102120100201212111210210101021 |
4 | 1301223333100310023022323 |
5 | 1011014013321000231021 |
6 | 4531225445312203311 |
7 | 210213650450140513 |
oct | 16153772064131273 |
9 | 2376321774723337 |
10 | 500002121102011 |
11 | 135352788374140 |
12 | 480b3916839537 |
13 | 185cbcc7c5c738 |
14 | 8b6833603a843 |
15 | 3cc1308c32c41 |
hex | 1c6bfd0d0b2bb |
500002121102011 has 8 divisors (see below), whose sum is σ = 546943117860864. Its totient is φ = 453308834089320.
The previous prime is 500002121102009. The next prime is 500002121102021. The reversal of 500002121102011 is 110201121200005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 500002121102011 - 21 = 500002121102009 is a prime.
It is a super-2 number, since 2×5000021211020112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (500002121102021) 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, 61927432315 + ... + 61927440388.
It is an arithmetic number, because the mean of its divisors is an integer number (68367889732608).
Almost surely, 2500002121102011 is an apocalyptic number.
500002121102011 is a deficient number, since it is larger than the sum of its proper divisors (46940996758853).
500002121102011 is a wasteful number, since it uses less digits than its factorization.
500002121102011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 123854873081.
The product of its (nonzero) digits is 40, while the sum is 16.
Adding to 500002121102011 its reverse (110201121200005), we get a palindrome (610203242302016).
The spelling of 500002121102011 in words is "five hundred trillion, two billion, one hundred twenty-one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •