Search a number
-
+
150000001367 = 3716734769959
BaseRepresentation
bin1000101110110010110…
…0100110000101010111
3112100011202110120202012
42023230230212011113
54424200000020432
6152524204334435
713560065655146
oct2135454460527
9470152416665
10150000001367
11586840aa187
12250a284441b
13111b657cc78
14738d79175d
153d7dacecb2
hex22ecb26157

150000001367 has 16 divisors (see below), whose sum is σ = 155425374720. Its totient is φ = 144651876768.

The previous prime is 150000001357. The next prime is 150000001391. The reversal of 150000001367 is 763100000051.

150000001367 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a cyclic number.

It is not a de Polignac number, because 150000001367 - 228 = 149731565911 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2150000001367 is an apocalyptic number.

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

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

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

The sum of its prime factors is 70510.

The product of its (nonzero) digits is 630, while the sum is 23.

The spelling of 150000001367 in words is "one hundred fifty billion, one thousand, three hundred sixty-seven".

Divisors: 1 37 167 347 6179 12839 57949 69959 2144113 2588483 11683153 24275773 432276661 898203601 4054054091 150000001367