Base | Representation |
---|---|
bin | 10010101100111000… |
… | …11000011100001001 |
3 | 221220201102210011010 |
4 | 21112130120130021 |
5 | 131030243342210 |
6 | 4340140354133 |
7 | 503543264511 |
oct | 112634303411 |
9 | 27821383133 |
10 | 10040215305 |
11 | 42924923aa |
12 | 1b42545949 |
13 | c4012b003 |
14 | 6b3630841 |
15 | 3db6a3920 |
hex | 256718709 |
10040215305 has 8 divisors (see below), whose sum is σ = 16064344512. Its totient is φ = 5354781488.
The previous prime is 10040215279. The next prime is 10040215331. The reversal of 10040215305 is 50351204001.
10040215305 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10040215279) and next prime (10040215331).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10040215305 - 219 = 10039691017 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 334673829 + ... + 334673858.
It is an arithmetic number, because the mean of its divisors is an integer number (2008043064).
Almost surely, 210040215305 is an apocalyptic number.
10040215305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10040215305 is a deficient number, since it is larger than the sum of its proper divisors (6024129207).
10040215305 is an equidigital number, since it uses as much as digits as its factorization.
10040215305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 669347695.
The product of its (nonzero) digits is 600, while the sum is 21.
Adding to 10040215305 its reverse (50351204001), we get a palindrome (60391419306).
The spelling of 10040215305 in words is "ten billion, forty million, two hundred fifteen thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •