Search a number
-
+
150000100011 = 3216666677779
BaseRepresentation
bin1000101110110010110…
…0111110001010101011
3112100011202122121001200
42023230230332022223
54424200011200021
6152524210415243
713560066545556
oct2135454761253
9470152577050
10150000100011
1158684167303
12250a2891523
13111b65b5b38
14738d7b969d
153d7daee126
hex22ecb3e2ab

150000100011 has 6 divisors (see below), whose sum is σ = 216666811140. Its totient is φ = 100000066668.

The previous prime is 150000100001. The next prime is 150000100027. The reversal of 150000100011 is 110001000051.

It is not a de Polignac number, because 150000100011 - 210 = 150000098987 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 16666677779 = 150000100011 / (1 + 5 + 0 + 0 + 0 + 0 + 1 + 0 + 0 + 0 + 1 + 1).

It is a junction number, because it is equal to n+sod(n) for n = 150000099966 and 150000100002.

It is not an unprimeable number, because it can be changed into a prime (150000100001) by changing a digit.

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8333338881 + ... + 8333338898.

It is an arithmetic number, because the mean of its divisors is an integer number (36111135190).

Almost surely, 2150000100011 is an apocalyptic number.

150000100011 is a deficient number, since it is larger than the sum of its proper divisors (66666711129).

150000100011 is a wasteful number, since it uses less digits than its factorization.

150000100011 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 16666677785 (or 16666677782 counting only the distinct ones).

The product of its (nonzero) digits is 5, while the sum is 9.

Adding to 150000100011 its reverse (110001000051), we get a palindrome (260001100062).

The spelling of 150000100011 in words is "one hundred fifty billion, one hundred thousand, eleven".

Divisors: 1 3 9 16666677779 50000033337 150000100011