Base | Representation |
---|---|
bin | 10011011001000101… |
… | …10111100011001100 |
3 | 222212120011022211000 |
4 | 21230202313203030 |
5 | 132310204424343 |
6 | 4441024100300 |
7 | 515665106340 |
oct | 115442674314 |
9 | 28776138730 |
10 | 10411014348 |
11 | 4462823199 |
12 | 2026764690 |
13 | c9bbb7227 |
14 | 70a993620 |
15 | 40dee9ed3 |
hex | 26c8b78cc |
10411014348 has 48 divisors (see below), whose sum is σ = 30847452160. Its totient is φ = 2974575312.
The previous prime is 10411014347. The next prime is 10411014391. The reversal of 10411014348 is 84341011401.
10411014348 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (10411014347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6884836 + ... + 6886347.
Almost surely, 210411014348 is an apocalyptic number.
10411014348 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
10411014348 is an abundant number, since it is smaller than the sum of its proper divisors (20436437812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10411014348 is a wasteful number, since it uses less digits than its factorization.
10411014348 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13771203 (or 13771195 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
Adding to 10411014348 its reverse (84341011401), we get a palindrome (94752025749).
The spelling of 10411014348 in words is "ten billion, four hundred eleven million, fourteen thousand, three hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •