Base | Representation |
---|---|
bin | 10000010011011101001… |
… | …000010010011001100011 |
3 | 10222002221200222000012020 |
4 | 100103131020102121203 |
5 | 121324040231343321 |
6 | 2214412203032523 |
7 | 143642410025403 |
oct | 20233510223143 |
9 | 3862850860166 |
10 | 1120401434211 |
11 | 3a2183445524 |
12 | 16118420b743 |
13 | 818656a7237 |
14 | 3c328c08803 |
15 | 1e226ab54c6 |
hex | 104dd212663 |
1120401434211 has 8 divisors (see below), whose sum is σ = 1493887651344. Its totient is φ = 746924753280.
The previous prime is 1120401434197. The next prime is 1120401434213. The reversal of 1120401434211 is 1124341040211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1120401434211 - 26 = 1120401434147 is a prime.
It is a super-2 number, since 2×11204014342112 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1120401434213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2105250 + ... + 2583191.
It is an arithmetic number, because the mean of its divisors is an integer number (186735956418).
Almost surely, 21120401434211 is an apocalyptic number.
1120401434211 is a deficient number, since it is larger than the sum of its proper divisors (373486217133).
1120401434211 is an equidigital number, since it uses as much as digits as its factorization.
1120401434211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4768101.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 1120401434211 its reverse (1124341040211), we get a palindrome (2244742474422).
The spelling of 1120401434211 in words is "one trillion, one hundred twenty billion, four hundred one million, four hundred thirty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •