Base | Representation |
---|---|
bin | 10010101000011011… |
… | …00111100000100011 |
3 | 221211010000101212211 |
4 | 21110031213200203 |
5 | 130441203243220 |
6 | 4332322302551 |
7 | 502610213221 |
oct | 112415474043 |
9 | 27733011784 |
10 | 10002790435 |
11 | 4273350560 |
12 | 1b31ab7a57 |
13 | c35456611 |
14 | 6ac68bb11 |
15 | 3d825eb5a |
hex | 254367823 |
10002790435 has 16 divisors (see below), whose sum is σ = 13341633120. Its totient is φ = 7137495040.
The previous prime is 10002790433. The next prime is 10002790487. The reversal of 10002790435 is 53409720001.
It is not a de Polignac number, because 10002790435 - 21 = 10002790433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10002790397 and 10002790406.
It is not an unprimeable number, because it can be changed into a prime (10002790433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1712830 + ... + 1718659.
It is an arithmetic number, because the mean of its divisors is an integer number (833852070).
Almost surely, 210002790435 is an apocalyptic number.
10002790435 is a deficient number, since it is larger than the sum of its proper divisors (3338842685).
10002790435 is a wasteful number, since it uses less digits than its factorization.
10002790435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3431558.
The product of its (nonzero) digits is 7560, while the sum is 31.
The spelling of 10002790435 in words is "ten billion, two million, seven hundred ninety thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •