Base | Representation |
---|---|
bin | 100010100100110001100101… |
… | …001101100110100011110011 |
3 | 201221101212022001010000120012 |
4 | 202210301211031212203303 |
5 | 124412330323333242321 |
6 | 1255223421442005135 |
7 | 44013011254432256 |
oct | 4244614515464363 |
9 | 657355261100505 |
10 | 152060720212211 |
11 | 444a6653388208 |
12 | 1507a4776467ab |
13 | 66b0358b25725 |
14 | 2979ac727909d |
15 | 128a6acec605b |
hex | 8a4c653668f3 |
152060720212211 has 8 divisors (see below), whose sum is σ = 152315447320848. Its totient is φ = 151805998800000.
The previous prime is 152060720212171. The next prime is 152060720212213. The reversal of 152060720212211 is 112212027060251.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 152060720212211 - 210 = 152060720211187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (152060720212213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53800511 + ... + 56556311.
It is an arithmetic number, because the mean of its divisors is an integer number (19039430915106).
Almost surely, 2152060720212211 is an apocalyptic number.
152060720212211 is a deficient number, since it is larger than the sum of its proper divisors (254727108637).
152060720212211 is an equidigital number, since it uses as much as digits as its factorization.
152060720212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2848213.
The product of its (nonzero) digits is 6720, while the sum is 32.
Adding to 152060720212211 its reverse (112212027060251), we get a palindrome (264272747272462).
The spelling of 152060720212211 in words is "one hundred fifty-two trillion, sixty billion, seven hundred twenty million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •