Base | Representation |
---|---|
bin | 10011001100011100… |
… | …10001110000110110 |
3 | 222121011120212112200 |
4 | 21212032101300312 |
5 | 132101032002043 |
6 | 4422314525330 |
7 | 513236441625 |
oct | 114616216066 |
9 | 28534525480 |
10 | 10304953398 |
11 | 4408972013 |
12 | 1bb7136846 |
13 | c82c30a7c |
14 | 6da8656bc |
15 | 404a497d3 |
hex | 266391c36 |
10304953398 has 48 divisors (see below), whose sum is σ = 22972837680. Its totient is φ = 3336026688.
The previous prime is 10304953391. The next prime is 10304953423. The reversal of 10304953398 is 89335940301.
10304953398 is a `hidden beast` number, since 1 + 0 + 304 + 9 + 5 + 339 + 8 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10304953391) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 357073 + ... + 384851.
It is an arithmetic number, because the mean of its divisors is an integer number (478600785).
Almost surely, 210304953398 is an apocalyptic number.
10304953398 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 10304953398, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11486418840).
10304953398 is an abundant number, since it is smaller than the sum of its proper divisors (12667884282).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10304953398 is a wasteful number, since it uses less digits than its factorization.
10304953398 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28381 (or 28378 counting only the distinct ones).
The product of its (nonzero) digits is 349920, while the sum is 45.
The spelling of 10304953398 in words is "ten billion, three hundred four million, nine hundred fifty-three thousand, three hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •