Base | Representation |
---|---|
bin | 101111101001000110… |
… | …1111000101011101010 |
3 | 100210002020101112211220 |
4 | 1133102031320223222 |
5 | 3134013120300320 |
6 | 115000122002510 |
7 | 10251236012511 |
oct | 1372215705352 |
9 | 323066345756 |
10 | 102311103210 |
11 | 3a431a50158 |
12 | 179b3946436 |
13 | 9856571634 |
14 | 4d47d7d678 |
15 | 29dc0a0e40 |
hex | 17d2378aea |
102311103210 has 16 divisors (see below), whose sum is σ = 245546647776. Its totient is φ = 27282960848.
The previous prime is 102311103203. The next prime is 102311103227. The reversal of 102311103210 is 12301113201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 102311103210.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1705185024 + ... + 1705185083.
It is an arithmetic number, because the mean of its divisors is an integer number (15346665486).
Almost surely, 2102311103210 is an apocalyptic number.
102311103210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102311103210 is an abundant number, since it is smaller than the sum of its proper divisors (143235544566).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102311103210 is a wasteful number, since it uses less digits than its factorization.
102311103210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3410370117.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 102311103210 its reverse (12301113201), we get a palindrome (114612216411).
Subtracting from 102311103210 its reverse (12301113201), we obtain a palindrome (90009990009).
The spelling of 102311103210 in words is "one hundred two billion, three hundred eleven million, one hundred three thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •