Base | Representation |
---|---|
bin | 11110011000010011… |
… | …01110001100100110 |
3 | 1120002200010222020120 |
4 | 33030021232030212 |
5 | 231400330034340 |
6 | 11254231542410 |
7 | 1115114506416 |
oct | 171411561446 |
9 | 46080128216 |
10 | 16310002470 |
11 | 6a0a631293 |
12 | 31b222aa06 |
13 | 16cc076a48 |
14 | b0a1ca646 |
15 | 656d2d4d0 |
hex | 3cc26e326 |
16310002470 has 32 divisors (see below), whose sum is σ = 41446595808. Its totient is φ = 4093490688.
The previous prime is 16310002459. The next prime is 16310002493. The reversal of 16310002470 is 7420001361.
16310002470 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×163100024702 (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 16310002470.
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, 15989689 + ... + 15990708.
It is an arithmetic number, because the mean of its divisors is an integer number (1295206119).
Almost surely, 216310002470 is an apocalyptic number.
16310002470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
16310002470 is an abundant number, since it is smaller than the sum of its proper divisors (25136593338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16310002470 is a wasteful number, since it uses less digits than its factorization.
16310002470 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31980424.
The product of its (nonzero) digits is 1008, while the sum is 24.
The spelling of 16310002470 in words is "sixteen billion, three hundred ten million, two thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •