Search a number
-
+
150333333051 = 31139711474951
BaseRepresentation
bin1000110000000010010…
…0001001111000111011
3112101000222200120212010
42030000210021320323
54430340313124201
6153021233021003
713601254150506
oct2140044117073
9471028616763
10150333333051
115883527a210
12251763b4763
131123a64b355
1473c1b6013d
153d9cec4bd6
hex2300909e3b

150333333051 has 16 divisors (see below), whose sum is σ = 219217483008. Its totient is φ = 90881604000.

The previous prime is 150333333043. The next prime is 150333333077.

150333333051 is nontrivially palindromic in base 10.

It is not a de Polignac number, because 150333333051 - 23 = 150333333043 is a prime.

It is a super-2 number, since 2×1503333330512 (a number of 23 digits) contains 22 as substring.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5724375 + ... + 5750576.

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

Almost surely, 2150333333051 is an apocalyptic number.

150333333051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 11475362.

The product of its (nonzero) digits is 18225, while the sum is 30.

It can be divided in two parts, 150333 and 333051, that added together give a palindrome (483384).

The spelling of 150333333051 in words is "one hundred fifty billion, three hundred thirty-three million, three hundred thirty-three thousand, fifty-one".

Divisors: 1 3 11 33 397 1191 4367 13101 11474951 34424853 126224461 378673383 4555555547 13666666641 50111111017 150333333051