Base | Representation |
---|---|
bin | 11101011101011100011… |
… | …10011101100011010101 |
3 | 10120202202202210011222121 |
4 | 32232232032131203111 |
5 | 113041032011404310 |
6 | 2053003343255541 |
7 | 133063154636002 |
oct | 16565616354325 |
9 | 3522682704877 |
10 | 1012240341205 |
11 | 36031a313465 |
12 | 1442192aa5b1 |
13 | 745b91705a2 |
14 | 36dc7d488a9 |
15 | 1b4e615e0da |
hex | ebae39d8d5 |
1012240341205 has 8 divisors (see below), whose sum is σ = 1214697910104. Its totient is φ = 809785939200.
The previous prime is 1012240341199. The next prime is 1012240341221. The reversal of 1012240341205 is 5021430422101.
It can be written as a sum of positive squares in 4 ways, for example, as 416884583556 + 595355757649 = 645666^2 + 771593^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1012240341205 - 23 = 1012240341197 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 1012240341205.
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, 20176 + ... + 1422985.
It is an arithmetic number, because the mean of its divisors is an integer number (151837238763).
Almost surely, 21012240341205 is an apocalyptic number.
It is an amenable number.
1012240341205 is a deficient number, since it is larger than the sum of its proper divisors (202457568899).
1012240341205 is a wasteful number, since it uses less digits than its factorization.
1012240341205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1583447.
The product of its (nonzero) digits is 1920, while the sum is 25.
Adding to 1012240341205 its reverse (5021430422101), we get a palindrome (6033670763306).
The spelling of 1012240341205 in words is "one trillion, twelve billion, two hundred forty million, three hundred forty-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •