Search a number
-
+
151053015032 = 2373892906207
BaseRepresentation
bin1000110010101101110…
…1100001011111111000
3112102220010220012221022
42030223131201133320
54433324032440112
6153220502202012
713625143304633
oct2145335413770
9472803805838
10151053015032
1159074541a07
1225337423308
131132378c18a
14744d57cc1a
153de1283d72
hex232b7617f8

151053015032 has 32 divisors (see below), whose sum is σ = 290330179200. Its totient is φ = 73654884864.

The previous prime is 151053015017. The next prime is 151053015059. The reversal of 151053015032 is 230510350151.

It is a happy number.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2151053015032 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 2250, while the sum is 26.

Adding to 151053015032 its reverse (230510350151), we get a palindrome (381563365183).

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

Divisors: 1 2 4 8 73 89 146 178 292 356 584 712 6497 12994 25988 51976 2906207 5812414 11624828 23249656 212153111 258652423 424306222 517304846 848612444 1034609692 1697224888 2069219384 18881626879 37763253758 75526507516 151053015032