Base | Representation |
---|---|
bin | 10000010011001101001… |
… | …101101001010010001101 |
3 | 10222002021002111102112021 |
4 | 100103031031221102031 |
5 | 121323013401400323 |
6 | 2214325503410141 |
7 | 143632655221360 |
oct | 20231515512215 |
9 | 3862232442467 |
10 | 1120134403213 |
11 | 3a205673a151 |
12 | 16110a8b3951 |
13 | 81822280927 |
14 | 3c3015780d7 |
15 | 1e20d41a05d |
hex | 104cd36948d |
1120134403213 has 8 divisors (see below), whose sum is σ = 1280768783040. Its totient is φ = 959653818240.
The previous prime is 1120134403207. The next prime is 1120134403217. The reversal of 1120134403213 is 3123044310211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1120134403213 is a prime.
It is a super-2 number, since 2×11201344032132 (a number of 25 digits) contains 22 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 (1120134403217) 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, 38433103 + ... + 38462236.
It is an arithmetic number, because the mean of its divisors is an integer number (160096097880).
Almost surely, 21120134403213 is an apocalyptic number.
It is an amenable number.
1120134403213 is a deficient number, since it is larger than the sum of its proper divisors (160634379827).
1120134403213 is an equidigital number, since it uses as much as digits as its factorization.
1120134403213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76897427.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1120134403213 its reverse (3123044310211), we get a palindrome (4243178713424).
The spelling of 1120134403213 in words is "one trillion, one hundred twenty billion, one hundred thirty-four million, four hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.801 sec. • engine limits •