Base | Representation |
---|---|
bin | 11101110000000011101… |
… | …01111001001000011110 |
3 | 10121201120011222000021110 |
4 | 32320001311321020132 |
5 | 113222013134340220 |
6 | 2101335111242450 |
7 | 133565614110462 |
oct | 16700165711036 |
9 | 3551504860243 |
10 | 1022233121310 |
11 | 364587a47015 |
12 | 146147979426 |
13 | 7551c50071b |
14 | 3769514c4a2 |
15 | 1b8cd592be0 |
hex | ee01d7921e |
1022233121310 has 64 divisors (see below), whose sum is σ = 2484073645632. Its totient is φ = 269203439616.
The previous prime is 1022233121303. The next prime is 1022233121423. The reversal of 1022233121310 is 131213322201.
1022233121310 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10222331213102 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 148882 + ... + 1437578.
It is an arithmetic number, because the mean of its divisors is an integer number (38813650713).
Almost surely, 21022233121310 is an apocalyptic number.
1022233121310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1022233121310 is an abundant number, since it is smaller than the sum of its proper divisors (1461840524322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022233121310 is a wasteful number, since it uses less digits than its factorization.
1022233121310 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1289037.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1022233121310 its reverse (131213322201), we get a palindrome (1153446443511).
The spelling of 1022233121310 in words is "one trillion, twenty-two billion, two hundred thirty-three million, one hundred twenty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •