Base | Representation |
---|---|
bin | 100010001011110010001101… |
… | …101100001100001111011011 |
3 | 201201022200121220111021222122 |
4 | 202023302031230030033123 |
5 | 124201211302033313430 |
6 | 1251430450555411455 |
7 | 43444644625044113 |
oct | 4213621554141733 |
9 | 651280556437878 |
10 | 150343412401115 |
11 | 439a431294600a |
12 | 14a41688753b8b |
13 | 65b74276c561b |
14 | 291a935004043 |
15 | 125ab9ce7bee5 |
hex | 88bc8db0c3db |
150343412401115 has 4 divisors (see below), whose sum is σ = 180412094881344. Its totient is φ = 120274729920888.
The previous prime is 150343412401109. The next prime is 150343412401151. The reversal of 150343412401115 is 511104214343051.
150343412401115 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 150343412401115 - 222 = 150343408206811 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15034341240107 + ... + 15034341240116.
It is an arithmetic number, because the mean of its divisors is an integer number (45103023720336).
Almost surely, 2150343412401115 is an apocalyptic number.
150343412401115 is a deficient number, since it is larger than the sum of its proper divisors (30068682480229).
150343412401115 is an equidigital number, since it uses as much as digits as its factorization.
150343412401115 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30068682480228.
The product of its (nonzero) digits is 28800, while the sum is 35.
Adding to 150343412401115 its reverse (511104214343051), we get a palindrome (661447626744166).
The spelling of 150343412401115 in words is "one hundred fifty trillion, three hundred forty-three billion, four hundred twelve million, four hundred one thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •