Base | Representation |
---|---|
bin | 10010101101000001… |
… | …10011111000110110 |
3 | 221220210121202202022 |
4 | 21112200303320312 |
5 | 131031043020220 |
6 | 4340221313142 |
7 | 503556201410 |
oct | 112640637066 |
9 | 27823552668 |
10 | 10041376310 |
11 | 4293105709 |
12 | 1b42a057b2 |
13 | c404465b4 |
14 | 6b38539b0 |
15 | 3db832925 |
hex | 256833e36 |
10041376310 has 32 divisors (see below), whose sum is σ = 21743735040. Its totient is φ = 3261559392.
The previous prime is 10041376309. The next prime is 10041376357. The reversal of 10041376310 is 1367314001.
10041376310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×100413763102 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10041376310.
It is a congruent number.
It is an unprimeable number.
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, 3773624 + ... + 3776283.
It is an arithmetic number, because the mean of its divisors is an integer number (679491720).
Almost surely, 210041376310 is an apocalyptic number.
10041376310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10041376310 is an abundant number, since it is smaller than the sum of its proper divisors (11702358730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10041376310 is a wasteful number, since it uses less digits than its factorization.
10041376310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7549940.
The product of its (nonzero) digits is 1512, while the sum is 26.
The spelling of 10041376310 in words is "ten billion, forty-one million, three hundred seventy-six thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •