Base | Representation |
---|---|
bin | 1001101101101111001111… |
… | …1000111001110001111100 |
3 | 1101211010111202210221020012 |
4 | 2123123303320321301330 |
5 | 2400000431400244301 |
6 | 34414543005242352 |
7 | 2151463365011330 |
oct | 233336370716174 |
9 | 41733452727205 |
10 | 10681380478076 |
11 | 3448a478a9270 |
12 | 12461588633b8 |
13 | 5c6332c22669 |
14 | 28cda561b7c0 |
15 | 137ca9569ebb |
hex | 9b6f3e39c7c |
10681380478076 has 96 divisors (see below), whose sum is σ = 23376439296000. Its totient is φ = 4148796185280.
The previous prime is 10681380478007. The next prime is 10681380478151. The reversal of 10681380478076 is 67087408318601.
It is a super-2 number, since 2×106813804780762 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 453222845 + ... + 453246411.
It is an arithmetic number, because the mean of its divisors is an integer number (243504576000).
Almost surely, 210681380478076 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10681380478076, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11688219648000).
10681380478076 is an abundant number, since it is smaller than the sum of its proper divisors (12695058817924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10681380478076 is a wasteful number, since it uses less digits than its factorization.
10681380478076 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28047 (or 28045 counting only the distinct ones).
The product of its (nonzero) digits is 10838016, while the sum is 59.
The spelling of 10681380478076 in words is "ten trillion, six hundred eighty-one billion, three hundred eighty million, four hundred seventy-eight thousand, seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •