Base | Representation |
---|---|
bin | 10011100001100001… |
… | …00000001100111010 |
3 | 1000001111011102000000 |
4 | 21300300200030322 |
5 | 132431303310334 |
6 | 4452031053430 |
7 | 520513650054 |
oct | 116060401472 |
9 | 30044142000 |
10 | 10481697594 |
11 | 44997105a5 |
12 | 2046371276 |
13 | cb0734a34 |
14 | 7161128d4 |
15 | 41530d299 |
hex | 270c2033a |
10481697594 has 56 divisors (see below), whose sum is σ = 23621916000. Its totient is φ = 3486655368.
The previous prime is 10481697571. The next prime is 10481697607. The reversal of 10481697594 is 49579618401.
10481697594 is a `hidden beast` number, since 1 + 0 + 48 + 1 + 6 + 9 + 7 + 594 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a self number, because there is not a number n which added to its sum of digits gives 10481697594.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 720339 + ... + 734745.
Almost surely, 210481697594 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10481697594, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11810958000).
10481697594 is an abundant number, since it is smaller than the sum of its proper divisors (13140218406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10481697594 is an equidigital number, since it uses as much as digits as its factorization.
10481697594 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14926 (or 14911 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 54.
The spelling of 10481697594 in words is "ten billion, four hundred eighty-one million, six hundred ninety-seven thousand, five hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •