Base | Representation |
---|---|
bin | 11101011011100100010… |
… | …00110100111100101101 |
3 | 10120200011111211220001111 |
4 | 32231302020310330231 |
5 | 113032000422344323 |
6 | 2052315332112021 |
7 | 133026164066551 |
oct | 16556210647455 |
9 | 3520144756044 |
10 | 1011232231213 |
11 | 35a952260506 |
12 | 143b97765611 |
13 | 74488353bb9 |
14 | 36d300c9861 |
15 | 1b4878c9c0d |
hex | eb72234f2d |
1011232231213 has 4 divisors (see below), whose sum is σ = 1011481983900. Its totient is φ = 1010982478528.
The previous prime is 1011232231211. The next prime is 1011232231277. The reversal of 1011232231213 is 3121322321101.
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 197507358724 + 813724872489 = 444418^2 + 902067^2 .
It is a cyclic number.
It is not a de Polignac number, because 1011232231213 - 21 = 1011232231211 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011232231211) 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, 124870270 + ... + 124878367.
It is an arithmetic number, because the mean of its divisors is an integer number (252870495975).
Almost surely, 21011232231213 is an apocalyptic number.
It is an amenable number.
1011232231213 is a deficient number, since it is larger than the sum of its proper divisors (249752687).
1011232231213 is an equidigital number, since it uses as much as digits as its factorization.
1011232231213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 249752686.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1011232231213 its reverse (3121322321101), we get a palindrome (4132554552314).
The spelling of 1011232231213 in words is "one trillion, eleven billion, two hundred thirty-two million, two hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •