Search a number
-
+
100053221115 = 3517820947797
BaseRepresentation
bin101110100101110100…
…0101111111011111011
3100120020212210020220010
41131023220233323323
53114402111033430
6113544103433003
710141261230051
oct1351350577373
9316225706803
10100053221115
11394834869a1
1217483755763
139586855023
144bb21561d1
152908c4dcb0
hex174ba2fefb

100053221115 has 32 divisors (see below), whose sum is σ = 169526122560. Its totient is φ = 50215624704.

The previous prime is 100053221083. The next prime is 100053221123. The reversal of 100053221115 is 511122350001.

It is not a de Polignac number, because 100053221115 - 25 = 100053221083 is a prime.

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

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2069397 + ... + 2117193.

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

Almost surely, 2100053221115 is an apocalyptic number.

100053221115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 56031.

The product of its (nonzero) digits is 300, while the sum is 21.

Adding to 100053221115 its reverse (511122350001), we get a palindrome (611175571116).

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

Divisors: 1 3 5 15 17 51 85 255 8209 24627 41045 47797 123135 139553 143391 238985 418659 697765 716955 812549 2093295 2437647 4062745 12188235 392365573 1177096719 1961827865 5885483595 6670214741 20010644223 33351073705 100053221115