Base | Representation |
---|---|
bin | 10000011101100010000… |
… | …101100001010001001001 |
3 | 11000010212210210100210122 |
4 | 100131202011201101021 |
5 | 122013220313404001 |
6 | 2223402021353025 |
7 | 144504510313343 |
oct | 20354205412111 |
9 | 4003783710718 |
10 | 1131222013001 |
11 | 3a6826376523 |
12 | 1632a3b68775 |
13 | 8289b3a1292 |
14 | 3ca73d32293 |
15 | 1e65ba12b1b |
hex | 10762161449 |
1131222013001 has 8 divisors (see below), whose sum is σ = 1198917308160. Its totient is φ = 1063654809408.
The previous prime is 1131222012997. The next prime is 1131222013021. The reversal of 1131222013001 is 1003102221311.
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 1131222013001 - 22 = 1131222012997 is a prime.
It is a super-2 number, since 2×11312220130012 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1131222013021) 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, 32004701 + ... + 32040026.
It is an arithmetic number, because the mean of its divisors is an integer number (149864663520).
Almost surely, 21131222013001 is an apocalyptic number.
It is an amenable number.
1131222013001 is a deficient number, since it is larger than the sum of its proper divisors (67695295159).
1131222013001 is a wasteful number, since it uses less digits than its factorization.
1131222013001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64045783.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 1131222013001 its reverse (1003102221311), we get a palindrome (2134324234312).
The spelling of 1131222013001 in words is "one trillion, one hundred thirty-one billion, two hundred twenty-two million, thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •