Base | Representation |
---|---|
bin | 10111001111100001111101… |
… | …001001001010110001100110 |
3 | 111101221100200022201112002211 |
4 | 113033201331021022301212 |
5 | 101344302303211401410 |
6 | 1001224141442354034 |
7 | 30350214261520660 |
oct | 2717417511126146 |
9 | 441840608645084 |
10 | 102222321200230 |
11 | 2a631274429280 |
12 | b56b45465b91a |
13 | 45066a625ca6a |
14 | 1b35830055530 |
15 | bc408564a68a |
hex | 5cf87d24ac66 |
102222321200230 has 64 divisors (see below), whose sum is σ = 229447977454080. Its totient is φ = 31855230777600.
The previous prime is 102222321200161. The next prime is 102222321200239. The reversal of 102222321200230 is 32002123222201.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102222321200239) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9151620 + ... + 16976359.
It is an arithmetic number, because the mean of its divisors is an integer number (3585124647720).
Almost surely, 2102222321200230 is an apocalyptic number.
102222321200230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102222321200230 is an abundant number, since it is smaller than the sum of its proper divisors (127225656253850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102222321200230 is a wasteful number, since it uses less digits than its factorization.
102222321200230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26133085.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 102222321200230 its reverse (32002123222201), we get a palindrome (134224444422431).
The spelling of 102222321200230 in words is "one hundred two trillion, two hundred twenty-two billion, three hundred twenty-one million, two hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •