Base | Representation |
---|---|
bin | 101111100000001000… |
… | …1101001101001100000 |
3 | 100202022021000000111201 |
4 | 1133000101221221200 |
5 | 3132404041202240 |
6 | 114510210250544 |
7 | 10240622355202 |
oct | 1370021515140 |
9 | 322267000451 |
10 | 102010100320 |
11 | 3a298051237 |
12 | 1792ab86a54 |
13 | 98090b220b |
14 | 4d19dc8772 |
15 | 29c0944d9a |
hex | 17c0469a60 |
102010100320 has 48 divisors (see below), whose sum is σ = 243209902320. Its totient is φ = 40429684224.
The previous prime is 102010100303. The next prime is 102010100323. The reversal of 102010100320 is 23001010201.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 102010100297 and 102010100306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102010100323) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2907162 + ... + 2942041.
It is an arithmetic number, because the mean of its divisors is an integer number (5066872965).
Almost surely, 2102010100320 is an apocalyptic number.
102010100320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102010100320 is an abundant number, since it is smaller than the sum of its proper divisors (141199802000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102010100320 is a wasteful number, since it uses less digits than its factorization.
102010100320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5849327 (or 5849319 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 102010100320 its reverse (23001010201), we get a palindrome (125011110521).
The spelling of 102010100320 in words is "one hundred two billion, ten million, one hundred thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •