Base | Representation |
---|---|
bin | 1001111010111011100011… |
… | …0100011100010110111010 |
3 | 1102121210111212011201211220 |
4 | 2132232320310130112322 |
5 | 2412204112304014210 |
6 | 35111024303132510 |
7 | 2204035654203000 |
oct | 236567064342672 |
9 | 42553455151756 |
10 | 10908022719930 |
11 | 35260804aa066 |
12 | 128206a8a4136 |
13 | 611811a80b8b |
14 | 299d45c14a70 |
15 | 13db21956c70 |
hex | 9ebb8d1c5ba |
10908022719930 has 128 divisors (see below), whose sum is σ = 32325610636800. Its totient is φ = 2346599808000.
The previous prime is 10908022719889. The next prime is 10908022719943. The reversal of 10908022719930 is 3991722080901.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 31003321 + ... + 31353180.
It is an arithmetic number, because the mean of its divisors is an integer number (252543833100).
Almost surely, 210908022719930 is an apocalyptic number.
10908022719930 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10908022719930 is an abundant number, since it is smaller than the sum of its proper divisors (21417587916870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10908022719930 is a wasteful number, since it uses less digits than its factorization.
10908022719930 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62356549 (or 62356535 counting only the distinct ones).
The product of its (nonzero) digits is 489888, while the sum is 51.
The spelling of 10908022719930 in words is "ten trillion, nine hundred eight billion, twenty-two million, seven hundred nineteen thousand, nine hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •