Base | Representation |
---|---|
bin | 11101110000001011110… |
… | …01101110000010011110 |
3 | 10121201201221010110101010 |
4 | 32320011321232002132 |
5 | 113222133103431220 |
6 | 2101345543200050 |
7 | 133600402051650 |
oct | 16700571560236 |
9 | 3551657113333 |
10 | 1022301233310 |
11 | 364612438625 |
12 | 146166746026 |
13 | 7553065aa96 |
14 | 376a01dc6d0 |
15 | 1b8d45491e0 |
hex | ee05e6e09e |
1022301233310 has 128 divisors (see below), whose sum is σ = 2811520419840. Its totient is φ = 233045213184.
The previous prime is 1022301233299. The next prime is 1022301233333. The reversal of 1022301233310 is 133321032201.
It is a super-3 number, since 3×10223012333103 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 137089102 + ... + 137096558.
It is an arithmetic number, because the mean of its divisors is an integer number (21965003280).
Almost surely, 21022301233310 is an apocalyptic number.
1022301233310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1022301233310 is an abundant number, since it is smaller than the sum of its proper divisors (1789219186530).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022301233310 is a wasteful number, since it uses less digits than its factorization.
1022301233310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9130.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 1022301233310 its reverse (133321032201), we get a palindrome (1155622265511).
The spelling of 1022301233310 in words is "one trillion, twenty-two billion, three hundred one million, two hundred thirty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •