Search a number
-
+
105045152251 = 1317475317431
BaseRepresentation
bin110000111010100101…
…1011101000111111011
3101001010202222122001111
41201311023131013323
53210113024333001
6120131310101151
710406055030124
oct1416513350773
9331122878044
10105045152251
1140605282716
12184374aa7b7
139ba0b1a030
14512711704b
152aec10e851
hex18752dd1fb

105045152251 has 8 divisors (see below), whose sum is σ = 119779992864. Its totient is φ = 91260946560.

The previous prime is 105045152143. The next prime is 105045152287. The reversal of 105045152251 is 152251540501.

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 105045152251 - 213 = 105045144059 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (105045102251) 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, 237658495 + ... + 237658936.

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

Almost surely, 2105045152251 is an apocalyptic number.

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

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

105045152251 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 475317461.

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

Adding to 105045152251 its reverse (152251540501), we get a palindrome (257296692752).

The spelling of 105045152251 in words is "one hundred five billion, forty-five million, one hundred fifty-two thousand, two hundred fifty-one".

Divisors: 1 13 17 221 475317431 6179126603 8080396327 105045152251