Base | Representation |
---|---|
bin | 11101110000000011101… |
… | …01011100000010010011 |
3 | 10121201120011201221210102 |
4 | 32320001311130002103 |
5 | 113222013122032011 |
6 | 2101335104523015 |
7 | 133565613103145 |
oct | 16700165340223 |
9 | 3551504657712 |
10 | 1022233002131 |
11 | 364587975520 |
12 | 14614792046b |
13 | 7551c48b3c3 |
14 | 3769511ac95 |
15 | 1b8cd56c73b |
hex | ee01d5c093 |
1022233002131 has 8 divisors (see below), whose sum is σ = 1122548464128. Its totient is φ = 923148405000.
The previous prime is 1022233002097. The next prime is 1022233002163. The reversal of 1022233002131 is 1312003322201.
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 1022233002131 - 210 = 1022233001107 is a prime.
It is a super-2 number, since 2×10222330021312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1022233002431) 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, 307714475 + ... + 307717796.
It is an arithmetic number, because the mean of its divisors is an integer number (140318558016).
Almost surely, 21022233002131 is an apocalyptic number.
1022233002131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1022233002131 is a deficient number, since it is larger than the sum of its proper divisors (100315461997).
1022233002131 is a wasteful number, since it uses less digits than its factorization.
1022233002131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 615432433.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 1022233002131 its reverse (1312003322201), we get a palindrome (2334236324332).
The spelling of 1022233002131 in words is "one trillion, twenty-two billion, two hundred thirty-three million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •