Base | Representation |
---|---|
bin | 11101101100010011111… |
… | …10111101001010111111 |
3 | 10121112101001010012200010 |
4 | 32312021332331022333 |
5 | 113203403342344411 |
6 | 2100403355034303 |
7 | 133465025611260 |
oct | 16661176751277 |
9 | 3545331105603 |
10 | 1020222231231 |
11 | 363745941595 |
12 | 14588643b993 |
13 | 7528ba12638 |
14 | 3754405a967 |
15 | 1b811c7d7a6 |
hex | ed89fbd2bf |
1020222231231 has 16 divisors (see below), whose sum is σ = 1608232089600. Its totient is φ = 562881230688.
The previous prime is 1020222231221. The next prime is 1020222231251. The reversal of 1020222231231 is 1321322220201.
It is not a de Polignac number, because 1020222231231 - 29 = 1020222230719 is a prime.
It is a super-2 number, since 2×10202222312312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 1020222231198 and 1020222231207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020222231211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 837620271 + ... + 837621488.
It is an arithmetic number, because the mean of its divisors is an integer number (100514505600).
Almost surely, 21020222231231 is an apocalyptic number.
1020222231231 is a deficient number, since it is larger than the sum of its proper divisors (588009858369).
1020222231231 is a wasteful number, since it uses less digits than its factorization.
1020222231231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1675241798.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 1020222231231 its reverse (1321322220201), we get a palindrome (2341544451432).
The spelling of 1020222231231 in words is "one trillion, twenty billion, two hundred twenty-two million, two hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •