Base | Representation |
---|---|
bin | 10011001100101000… |
… | …00100110111111000 |
3 | 222121021110002200102 |
4 | 21212110010313320 |
5 | 132101424122324 |
6 | 4422411254532 |
7 | 513255402410 |
oct | 114624046770 |
9 | 28537402612 |
10 | 10306473464 |
11 | 4409810071 |
12 | 1bb774a448 |
13 | c83343911 |
14 | 6dab3d640 |
15 | 404c49dae |
hex | 266504df8 |
10306473464 has 32 divisors (see below), whose sum is σ = 22387847520. Its totient is φ = 4356550656.
The previous prime is 10306473461. The next prime is 10306473467. The reversal of 10306473464 is 46437460301.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10306473461) and next prime (10306473467).
It is a hoax number, since the sum of its digits (38) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10306473461) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1256489 + ... + 1264664.
It is an arithmetic number, because the mean of its divisors is an integer number (699620235).
Almost surely, 210306473464 is an apocalyptic number.
10306473464 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10306473464 is an abundant number, since it is smaller than the sum of its proper divisors (12081374056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10306473464 is a wasteful number, since it uses less digits than its factorization.
10306473464 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2521239 (or 2521235 counting only the distinct ones).
The product of its (nonzero) digits is 145152, while the sum is 38.
The spelling of 10306473464 in words is "ten billion, three hundred six million, four hundred seventy-three thousand, four hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •