Base | Representation |
---|---|
bin | 1001000110101100010… |
… | …0101110000011110001 |
3 | 112221201211211120001102 |
4 | 2101223010232003301 |
5 | 10030314244101001 |
6 | 155504533014145 |
7 | 14205054310253 |
oct | 2215304560361 |
9 | 487654746042 |
10 | 156415222001 |
11 | 60376351415 |
12 | 26393184355 |
13 | 119996891cc |
14 | 77db7a7cd3 |
15 | 4106dd5e6b |
hex | 246b12e0f1 |
156415222001 has 8 divisors (see below), whose sum is σ = 160303543680. Its totient is φ = 152574610032.
The previous prime is 156415221997. The next prime is 156415222031. The reversal of 156415222001 is 100222514651.
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 156415222001 - 22 = 156415221997 is a prime.
It is a super-2 number, since 2×1564152220012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (156415222031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11920790 + ... + 11933903.
It is an arithmetic number, because the mean of its divisors is an integer number (20037942960).
Almost surely, 2156415222001 is an apocalyptic number.
It is an amenable number.
156415222001 is a deficient number, since it is larger than the sum of its proper divisors (3888321679).
156415222001 is an equidigital number, since it uses as much as digits as its factorization.
156415222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23854855.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 156415222001 its reverse (100222514651), we get a palindrome (256637736652).
The spelling of 156415222001 in words is "one hundred fifty-six billion, four hundred fifteen million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •