Search a number
-
+
1101215097 = 32122357233
BaseRepresentation
bin100000110100011…
…0011010101111001
32211202010112010100
41001220303111321
54223402340342
6301134510013
736201113433
oct10150632571
92752115110
101101215097
11515675224
12268965309
131471b7a88
14a6377653
1566a25e4c
hex41a33579

1101215097 has 6 divisors (see below), whose sum is σ = 1590644042. Its totient is φ = 734143392.

The previous prime is 1101215021. The next prime is 1101215099. The reversal of 1101215097 is 7905121011.

It can be written as a sum of positive squares in only one way, i.e., 636855696 + 464359401 = 25236^2 + 21549^2 .

It is not a de Polignac number, because 1101215097 - 211 = 1101213049 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 1101215097.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 61178608 + ... + 61178625.

Almost surely, 21101215097 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 630, while the sum is 27.

The square root of 1101215097 is about 33184.5611241131. The cubic root of 1101215097 is about 1032.6600726987.

The spelling of 1101215097 in words is "one billion, one hundred one million, two hundred fifteen thousand, ninety-seven".

Divisors: 1 3 9 122357233 367071699 1101215097