Base | Representation |
---|---|
bin | 101111100000011111… |
… | …1000101010101101100 |
3 | 100202100002102002211010 |
4 | 1133000333011111230 |
5 | 3132420113311340 |
6 | 114511313425220 |
7 | 10241125531014 |
oct | 1370077052554 |
9 | 322302362733 |
10 | 102022010220 |
11 | 3a2a3846329 |
12 | 17932b6b210 |
13 | 980b6c21b0 |
14 | 4d1b808c44 |
15 | 29c19e8b80 |
hex | 17c0fc556c |
102022010220 has 96 divisors (see below), whose sum is σ = 307699741440. Its totient is φ = 25107874560.
The previous prime is 102022010203. The next prime is 102022010221. The reversal of 102022010220 is 22010220201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 102022010196 and 102022010205.
It is not an unprimeable number, because it can be changed into a prime (102022010221) 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, 4834051 + ... + 4855109.
It is an arithmetic number, because the mean of its divisors is an integer number (3205205640).
Almost surely, 2102022010220 is an apocalyptic number.
102022010220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102022010220 is an abundant number, since it is smaller than the sum of its proper divisors (205677731220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102022010220 is a wasteful number, since it uses less digits than its factorization.
102022010220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27295 (or 27293 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 102022010220 its reverse (22010220201), we get a palindrome (124032230421).
The spelling of 102022010220 in words is "one hundred two billion, twenty-two million, ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •