Base | Representation |
---|---|
bin | 10011001110110010… |
… | …11010111110101011 |
3 | 222122112122122212120 |
4 | 21213121122332223 |
5 | 132121102330242 |
6 | 4424301042323 |
7 | 513566044041 |
oct | 114731327653 |
9 | 28575578776 |
10 | 10324651947 |
11 | 4418aa6905 |
12 | 20018563a3 |
13 | c87039c0c |
14 | 6dd312391 |
15 | 40663b1ec |
hex | 26765afab |
10324651947 has 16 divisors (see below), whose sum is σ = 13883329152. Its totient is φ = 6824629760.
The previous prime is 10324651933. The next prime is 10324652011. The reversal of 10324651947 is 74915642301.
It is a cyclic number.
It is not a de Polignac number, because 10324651947 - 28 = 10324651691 is a prime.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 10324651899 and 10324651908.
It is not an unprimeable number, because it can be changed into a prime (10324651147) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 467488 + ... + 489074.
It is an arithmetic number, because the mean of its divisors is an integer number (867708072).
Almost surely, 210324651947 is an apocalyptic number.
10324651947 is a deficient number, since it is larger than the sum of its proper divisors (3558677205).
10324651947 is a wasteful number, since it uses less digits than its factorization.
10324651947 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22938.
The product of its (nonzero) digits is 181440, while the sum is 42.
The spelling of 10324651947 in words is "ten billion, three hundred twenty-four million, six hundred fifty-one thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •