Base | Representation |
---|---|
bin | 10000001101110011011… |
… | …000111000101100111101 |
3 | 10221112021202001210221111 |
4 | 100031303120320230331 |
5 | 121224123100330323 |
6 | 2211530043202021 |
7 | 143336124254056 |
oct | 20156330705475 |
9 | 3845252053844 |
10 | 1114332433213 |
11 | 39a64967621a |
12 | 15bb6b816311 |
13 | 8110922c59c |
14 | 3bd10b9772d |
15 | 1debdd9cc0d |
hex | 10373638b3d |
1114332433213 has 32 divisors (see below), whose sum is σ = 1180457736192. Its totient is φ = 1050494054400.
The previous prime is 1114332433177. The next prime is 1114332433217. The reversal of 1114332433213 is 3123342334111.
It is a cyclic number.
It is not a de Polignac number, because 1114332433213 - 229 = 1113795562301 is a prime.
It is a super-3 number, since 3×11143324332133 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114332433217) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 139409545 + ... + 139417537.
It is an arithmetic number, because the mean of its divisors is an integer number (36889304256).
Almost surely, 21114332433213 is an apocalyptic number.
It is an amenable number.
1114332433213 is a deficient number, since it is larger than the sum of its proper divisors (66125302979).
1114332433213 is an equidigital number, since it uses as much as digits as its factorization.
1114332433213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8845.
The product of its digits is 15552, while the sum is 31.
Adding to 1114332433213 its reverse (3123342334111), we get a palindrome (4237674767324).
The spelling of 1114332433213 in words is "one trillion, one hundred fourteen billion, three hundred thirty-two million, four hundred thirty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •