Search a number
-
+
10152615631 = 199479910631
BaseRepresentation
bin10010111010010010…
…01001111011001111
3222012112221022102011
421131021021323033
5131243032200011
64355233442051
7506406544324
oct113511117317
928175838364
1010152615631
11433a983434
121b74110327
13c5a4c3a92
146c452cb4b
153e64a7621
hex25d249ecf

10152615631 has 8 divisors (see below), whose sum is σ = 10206720000. Its totient is φ = 10098542520.

The previous prime is 10152615607. The next prime is 10152615643. The reversal of 10152615631 is 13651625101.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10152615631 - 27 = 10152615503 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10152615691) 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 7 ways as a sum of consecutive naturals, for example, 949686 + ... + 960316.

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

Almost surely, 210152615631 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15629.

The product of its (nonzero) digits is 5400, while the sum is 31.

The spelling of 10152615631 in words is "ten billion, one hundred fifty-two million, six hundred fifteen thousand, six hundred thirty-one".

Divisors: 1 199 4799 10631 955001 2115569 51018169 10152615631