Base | Representation |
---|---|
bin | 11101011101011110001… |
… | …11001111000110001101 |
3 | 10120202210210210022121211 |
4 | 32232233013033012031 |
5 | 113041044314133310 |
6 | 2053005034254421 |
7 | 133063425303451 |
oct | 16565707170615 |
9 | 3522723708554 |
10 | 1012255224205 |
11 | 360327759265 |
12 | 144222287411 |
13 | 745bc2818b4 |
14 | 36dc9d00661 |
15 | 1b4e75edc8a |
hex | ebaf1cf18d |
1012255224205 has 4 divisors (see below), whose sum is σ = 1214706269052. Its totient is φ = 809804179360.
The previous prime is 1012255224203. The next prime is 1012255224221. The reversal of 1012255224205 is 5024225522101.
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 445779222889 + 566476001316 = 667667^2 + 752646^2 .
It is not a de Polignac number, because 1012255224205 - 21 = 1012255224203 is a prime.
It is a super-3 number, since 3×10122552242053 (a number of 37 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012255224203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101225522416 + ... + 101225522425.
It is an arithmetic number, because the mean of its divisors is an integer number (303676567263).
Almost surely, 21012255224205 is an apocalyptic number.
It is an amenable number.
1012255224205 is a deficient number, since it is larger than the sum of its proper divisors (202451044847).
1012255224205 is an equidigital number, since it uses as much as digits as its factorization.
1012255224205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 202451044846.
The product of its (nonzero) digits is 16000, while the sum is 31.
The spelling of 1012255224205 in words is "one trillion, twelve billion, two hundred fifty-five million, two hundred twenty-four thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •