Base | Representation |
---|---|
bin | 10011111001111000… |
… | …10111001011011010 |
3 | 1000120201211210121000 |
4 | 21330330113023122 |
5 | 133341122223304 |
6 | 4524212525430 |
7 | 525545426400 |
oct | 117474271332 |
9 | 30521753530 |
10 | 10686132954 |
11 | 4594052942 |
12 | 20a2920876 |
13 | 1013bb2ac3 |
14 | 73532b470 |
15 | 428241939 |
hex | 27cf172da |
10686132954 has 96 divisors (see below), whose sum is σ = 27835790400. Its totient is φ = 3029775840.
The previous prime is 10686132929. The next prime is 10686132967. The reversal of 10686132954 is 45923168601.
10686132954 is a `hidden beast` number, since 1 + 0 + 6 + 8 + 613 + 29 + 5 + 4 = 666.
It is a super-2 number, since 2×106861329542 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 331212 + ... + 362040.
It is an arithmetic number, because the mean of its divisors is an integer number (289956150).
Almost surely, 210686132954 is an apocalyptic number.
10686132954 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10686132954, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13917895200).
10686132954 is an abundant number, since it is smaller than the sum of its proper divisors (17149657446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10686132954 is a wasteful number, since it uses less digits than its factorization.
10686132954 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30985 (or 30972 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 45.
The spelling of 10686132954 in words is "ten billion, six hundred eighty-six million, one hundred thirty-two thousand, nine hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •