Base | Representation |
---|---|
bin | 10011110111110011… |
… | …11001111100001010 |
3 | 1000112112001201010000 |
4 | 21323321321330022 |
5 | 133322142233230 |
6 | 4522351303430 |
7 | 525244360500 |
oct | 117371717412 |
9 | 30475051100 |
10 | 10668711690 |
11 | 4585233aaa |
12 | 2098b1ab76 |
13 | 10103c3370 |
14 | 732cb4670 |
15 | 42694eb60 |
hex | 27be79f0a |
10668711690 has 960 divisors, whose sum is σ = 40044533760. Its totient is φ = 2011806720.
The previous prime is 10668711673. The next prime is 10668711727. The reversal of 10668711690 is 9611786601.
It is a super-2 number, since 2×106687116902 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 479 ways as a sum of consecutive naturals, for example, 344151975 + ... + 344152005.
It is an arithmetic number, because the mean of its divisors is an integer number (41713056).
Almost surely, 210668711690 is an apocalyptic number.
10668711690 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10668711690, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20022266880).
10668711690 is an abundant number, since it is smaller than the sum of its proper divisors (29375822070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10668711690 is a wasteful number, since it uses less digits than its factorization.
10668711690 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129 (or 113 counting only the distinct ones).
The product of its (nonzero) digits is 108864, while the sum is 45.
The spelling of 10668711690 in words is "ten billion, six hundred sixty-eight million, seven hundred eleven thousand, six hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •