Base | Representation |
---|---|
bin | 11101011111001110111… |
… | …11100010101100000101 |
3 | 10120212020201122210201121 |
4 | 32233213133202230011 |
5 | 113100013441320010 |
6 | 2053242544153541 |
7 | 133126032264244 |
oct | 16574737425405 |
9 | 3525221583647 |
10 | 1013201120005 |
11 | 360772688828 |
12 | 1444470088b1 |
13 | 74710227559 |
14 | 370797a695b |
15 | 1b5506943da |
hex | ebe77e2b05 |
1013201120005 has 8 divisors (see below), whose sum is σ = 1218230033400. Its totient is φ = 808968436416.
The previous prime is 1013201119951. The next prime is 1013201120027. The reversal of 1013201120005 is 5000211023101.
It can be written as a sum of positive squares in 4 ways, for example, as 577598480001 + 435602640004 = 759999^2 + 660002^2 .
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 1013201120005 - 27 = 1013201119877 is a prime.
It is a super-2 number, since 2×10132011200052 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 199054650 + ... + 199059739.
It is an arithmetic number, because the mean of its divisors is an integer number (152278754175).
Almost surely, 21013201120005 is an apocalyptic number.
It is an amenable number.
1013201120005 is a deficient number, since it is larger than the sum of its proper divisors (205028913395).
1013201120005 is an equidigital number, since it uses as much as digits as its factorization.
1013201120005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 398114903.
The product of its (nonzero) digits is 60, while the sum is 16.
Adding to 1013201120005 its reverse (5000211023101), we get a palindrome (6013412143106).
The spelling of 1013201120005 in words is "one trillion, thirteen billion, two hundred one million, one hundred twenty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •