Base | Representation |
---|---|
bin | 11101011101111111001… |
… | …00111000011010111101 |
3 | 10120210112001112002020212 |
4 | 32232333210320122331 |
5 | 113042131021243401 |
6 | 2053052302322205 |
7 | 133103321105411 |
oct | 16567744703275 |
9 | 3523461462225 |
10 | 1012531431101 |
11 | 360459661623 |
12 | 14429a889365 |
13 | 7463456b928 |
14 | 3701487cd41 |
15 | 1b5119acdbb |
hex | ebbf9386bd |
1012531431101 has 8 divisors (see below), whose sum is σ = 1020020221440. Its totient is φ = 1005044062048.
The previous prime is 1012531431049. The next prime is 1012531431193. The reversal of 1012531431101 is 1011341352101.
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 1012531431101 - 210 = 1012531430077 is a prime.
It is a super-2 number, since 2×10125314311012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012531430101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1096610 + ... + 1796556.
It is an arithmetic number, because the mean of its divisors is an integer number (127502527680).
Almost surely, 21012531431101 is an apocalyptic number.
It is an amenable number.
1012531431101 is a deficient number, since it is larger than the sum of its proper divisors (7488790339).
1012531431101 is a wasteful number, since it uses less digits than its factorization.
1012531431101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 710643.
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 1012531431101 its reverse (1011341352101), we get a palindrome (2023872783202).
The spelling of 1012531431101 in words is "one trillion, twelve billion, five hundred thirty-one million, four hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.147 sec. • engine limits •