Base | Representation |
---|---|
bin | 101111101100010110… |
… | …1101011100011001010 |
3 | 100210100211111020011000 |
4 | 1133120231223203022 |
5 | 3134224021220242 |
6 | 115015014115430 |
7 | 10254031332330 |
oct | 1373055534312 |
9 | 323324436130 |
10 | 102420101322 |
11 | 3a488528040 |
12 | 17a2434bb76 |
13 | 9873015966 |
14 | 4d58633b50 |
15 | 29e6931a4c |
hex | 17d8b6b8ca |
102420101322 has 64 divisors (see below), whose sum is σ = 283761331200. Its totient is φ = 26602622640.
The previous prime is 102420101269. The next prime is 102420101353. The reversal of 102420101322 is 223101024201.
It is a happy number.
102420101322 is a `hidden beast` number, since 1 + 0 + 242 + 0 + 101 + 322 = 666.
It is a super-2 number, since 2×1024201013222 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 102420101295 and 102420101304.
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, 12311872 + ... + 12320187.
It is an arithmetic number, because the mean of its divisors is an integer number (4433770800).
Almost surely, 2102420101322 is an apocalyptic number.
102420101322 is an abundant number, since it is smaller than the sum of its proper divisors (181341229878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102420101322 is a wasteful number, since it uses less digits than its factorization.
102420101322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24632088 (or 24632082 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 102420101322 its reverse (223101024201), we get a palindrome (325521125523).
The spelling of 102420101322 in words is "one hundred two billion, four hundred twenty million, one hundred one thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •