Base | Representation |
---|---|
bin | 10010111010010111… |
… | …10111011100001100 |
3 | 222012121021102100000 |
4 | 21131023313130030 |
5 | 131243222420343 |
6 | 4355301004300 |
7 | 506415564354 |
oct | 113513673414 |
9 | 28177242300 |
10 | 10153326348 |
11 | 4340319400 |
12 | 1b743b3690 |
13 | c5a6b2419 |
14 | 6c4675b64 |
15 | 3e6597ed3 |
hex | 25d2f770c |
10153326348 has 216 divisors, whose sum is σ = 29523574080. Its totient is φ = 3048645600.
The previous prime is 10153326319. The next prime is 10153326361. The reversal of 10153326348 is 84362335101.
10153326348 is a `hidden beast` number, since 1 + 0 + 15 + 3 + 3 + 2 + 634 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 15406843 + ... + 15407501.
Almost surely, 210153326348 is an apocalyptic number.
10153326348 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10153326348, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14761787040).
10153326348 is an abundant number, since it is smaller than the sum of its proper divisors (19370247732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10153326348 is a wasteful number, since it uses less digits than its factorization.
10153326348 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 831 (or 806 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 10153326348 in words is "ten billion, one hundred fifty-three million, three hundred twenty-six thousand, three hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •