Search a number
-
+
151101110001002 = 2724234454369141
BaseRepresentation
bin100010010110110011110111…
…111111001001110101101010
3201211000010101011012110021112
4202112303313333021311222
5124301120033130013002
61253210520332510322
743553460236266430
oct4226636777116552
9654003334173245
10151101110001002
1144166691441457
1214b444a801b3a2
136640a095b6cc5
1429454930a6d50
15127074758e852
hex896cf7fc9d6a

151101110001002 has 16 divisors (see below), whose sum is σ = 259137379204992. Its totient is φ = 64730892342480.

The previous prime is 151101110000987. The next prime is 151101110001053. The reversal of 151101110001002 is 200100011101151.

It is a Harshad number since it is a multiple of its sum of digits (14).

It is an unprimeable number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2227150649 + ... + 2227218492.

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

Almost surely, 2151101110001002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4454371573.

The product of its (nonzero) digits is 10, while the sum is 14.

Adding to 151101110001002 its reverse (200100011101151), we get a palindrome (351201121102153).

The spelling of 151101110001002 in words is "one hundred fifty-one trillion, one hundred one billion, one hundred ten million, one thousand, two".

Divisors: 1 2 7 14 2423 4846 16961 33922 4454369141 8908738282 31180583987 62361167974 10792936428643 21585872857286 75550555000501 151101110001002