Base | Representation |
---|---|
bin | 1000101111001110010… |
… | …1001110101100001011 |
3 | 112100110210211002020122 |
4 | 2023303211032230023 |
5 | 4424414032323201 |
6 | 152543452213455 |
7 | 13563000535112 |
oct | 2136345165413 |
9 | 470423732218 |
10 | 150115511051 |
11 | 58733324330 |
12 | 2511546a28b |
13 | 112044940ac |
14 | 73a0c5cc79 |
15 | 3d88ce9e1b |
hex | 22f394eb0b |
150115511051 has 4 divisors (see below), whose sum is σ = 163762375704. Its totient is φ = 136468646400.
The previous prime is 150115511047. The next prime is 150115511059.
150115511051 is nontrivially palindromic in base 10.
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 150115511051 - 22 = 150115511047 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 150115511051.
It is not an unprimeable number, because it can be changed into a prime (150115511059) 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, 6823432310 + ... + 6823432331.
It is an arithmetic number, because the mean of its divisors is an integer number (40940593926).
Almost surely, 2150115511051 is an apocalyptic number.
150115511051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
150115511051 is a deficient number, since it is larger than the sum of its proper divisors (13646864653).
150115511051 is a wasteful number, since it uses less digits than its factorization.
150115511051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13646864652.
The product of its (nonzero) digits is 625, while the sum is 26.
It can be divided in two parts, 150115 and 511051, that added together give a palindrome (661166).
The spelling of 150115511051 in words is "one hundred fifty billion, one hundred fifteen million, five hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •