Base | Representation |
---|---|
bin | 101111011111111001… |
… | …1001101011010000000 |
3 | 100202021200222121000011 |
4 | 1132333303031122000 |
5 | 3132400020322240 |
6 | 114505323234304 |
7 | 10240464500662 |
oct | 1367763153200 |
9 | 322250877004 |
10 | 102002120320 |
11 | 3a2935a07a1 |
12 | 17928378994 |
13 | 9807549c19 |
14 | 4d18d0c532 |
15 | 29bedba6ea |
hex | 17bfccd680 |
102002120320 has 64 divisors (see below), whose sum is σ = 246935635200. Its totient is φ = 40284361728.
The previous prime is 102002120309. The next prime is 102002120329. The reversal of 102002120320 is 23021200201.
It is a tau number, because it is divible by the number of its divisors (64).
It is a self number, because there is not a number n which added to its sum of digits gives 102002120320.
It is not an unprimeable number, because it can be changed into a prime (102002120329) 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, 958164 + ... + 1059283.
It is an arithmetic number, because the mean of its divisors is an integer number (3858369300).
Almost surely, 2102002120320 is an apocalyptic number.
102002120320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102002120320 is an abundant number, since it is smaller than the sum of its proper divisors (144933514880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102002120320 is an equidigital number, since it uses as much as digits as its factorization.
102002120320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2017545 (or 2017533 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 102002120320 its reverse (23021200201), we get a palindrome (125023320521).
The spelling of 102002120320 in words is "one hundred two billion, two million, one hundred twenty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •