Search a number
-
+
1015213015121 = 2935007345349
BaseRepresentation
bin11101100010111110110…
…10010100000001010001
310121001102221101122222112
432301133122110001101
5113113124012440441
62054214334115105
7133226632150544
oct16613732240121
93531387348875
101015213015121
1136160530a368
1214490894ba95
1374970ca7c36
14371caa7a85b
151b61c1064eb
hexec5f694051

1015213015121 has 4 divisors (see below), whose sum is σ = 1050220360500. Its totient is φ = 980205669744.

The previous prime is 1015213015073. The next prime is 1015213015147. The reversal of 1015213015121 is 1215103125101.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 280146845521 + 735066169600 = 529289^2 + 857360^2 .

It is a cyclic number.

It is not a de Polignac number, because 1015213015121 - 222 = 1015208820817 is a prime.

It is a Duffinian number.

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

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

Almost surely, 21015213015121 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 35007345378.

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

The spelling of 1015213015121 in words is "one trillion, fifteen billion, two hundred thirteen million, fifteen thousand, one hundred twenty-one".

Divisors: 1 29 35007345349 1015213015121