Base | Representation |
---|---|
bin | 10011011110111110… |
… | …01000000101011010 |
3 | 1000000000000121101100 |
4 | 21233133020011122 |
5 | 132410323141041 |
6 | 4445545532230 |
7 | 520134431250 |
oct | 115737100532 |
9 | 30000017340 |
10 | 10460365146 |
11 | 4488670180 |
12 | 203b1a4076 |
13 | ca91a5c9a |
14 | 71335c5d0 |
15 | 4134e76b6 |
hex | 26f7c815a |
10460365146 has 192 divisors, whose sum is σ = 29841177600. Its totient is φ = 2565561600.
The previous prime is 10460365099. The next prime is 10460365147. The reversal of 10460365146 is 64156306401.
It is a happy number.
10460365146 is a `hidden beast` number, since 1 + 0 + 4 + 603 + 6 + 5 + 1 + 46 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 10460365146.
It is not an unprimeable number, because it can be changed into a prime (10460365147) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 12929590 + ... + 12930398.
It is an arithmetic number, because the mean of its divisors is an integer number (155422800).
Almost surely, 210460365146 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10460365146, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14920588800).
10460365146 is an abundant number, since it is smaller than the sum of its proper divisors (19380812454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10460365146 is a wasteful number, since it uses less digits than its factorization.
10460365146 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1345 (or 1342 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 10460365146 in words is "ten billion, four hundred sixty million, three hundred sixty-five thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •