Search a number
-
+
10051015433 = 23929470399
BaseRepresentation
bin10010101110001011…
…00101001100001001
3221221110202111010212
421113011211030021
5131041024443213
64341204050505
7504034135664
oct112705451411
927843674125
1010051015433
114298599728
121b46093a35
13c4243cb14
146b4c426db
153dc5d89a8
hex257165309

10051015433 has 8 divisors (see below), whose sum is σ = 10499328000. Its totient is φ = 9603645568.

The previous prime is 10051015423. The next prime is 10051015463. The reversal of 10051015433 is 33451015001.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10051015433 is a prime.

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

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

It is a Duffinian number.

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

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

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

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

Almost surely, 210051015433 is an apocalyptic number.

It is an amenable number.

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

10051015433 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 471351.

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

The spelling of 10051015433 in words is "ten billion, fifty-one million, fifteen thousand, four hundred thirty-three".

Divisors: 1 23 929 21367 470399 10819177 437000671 10051015433