Base | Representation |
---|---|
bin | 10011011001000100… |
… | …01001010110001000 |
3 | 222212112210201012200 |
4 | 21230202021112020 |
5 | 132310132400341 |
6 | 4441020040200 |
7 | 515663360520 |
oct | 115442112610 |
9 | 28775721180 |
10 | 10410825096 |
11 | 4462703a91 |
12 | 2026693060 |
13 | c9bb4c049 |
14 | 70a944680 |
15 | 40deaddb6 |
hex | 26c889588 |
10410825096 has 96 divisors (see below), whose sum is σ = 32386224000. Its totient is φ = 2959545600.
The previous prime is 10410825023. The next prime is 10410825181. The reversal of 10410825096 is 69052801401.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 10410825096.
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 23 ways as a sum of consecutive naturals, for example, 48396 + ... + 152196.
It is an arithmetic number, because the mean of its divisors is an integer number (337356500).
Almost surely, 210410825096 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10410825096, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16193112000).
10410825096 is an abundant number, since it is smaller than the sum of its proper divisors (21975398904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10410825096 is a wasteful number, since it uses less digits than its factorization.
10410825096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104019 (or 104012 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The spelling of 10410825096 in words is "ten billion, four hundred ten million, eight hundred twenty-five thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •