Base | Representation |
---|---|
bin | 10011001100100111… |
… | …11111010001001000 |
3 | 222121021101221012001 |
4 | 21212103333101020 |
5 | 132101422404004 |
6 | 4422411000344 |
7 | 513255245440 |
oct | 114623772110 |
9 | 28537357161 |
10 | 10306450504 |
11 | 44097a4899 |
12 | 1bb77390b4 |
13 | c8333632c |
14 | 6dab35120 |
15 | 404c431a4 |
hex | 2664ff448 |
10306450504 has 16 divisors (see below), whose sum is σ = 22085251200. Its totient is φ = 4417050192.
The previous prime is 10306450501. The next prime is 10306450513. The reversal of 10306450504 is 40505460301.
10306450504 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (10306450501) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 92021824 + ... + 92021935.
It is an arithmetic number, because the mean of its divisors is an integer number (1380328200).
Almost surely, 210306450504 is an apocalyptic number.
10306450504 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10306450504 is an abundant number, since it is smaller than the sum of its proper divisors (11778800696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10306450504 is a wasteful number, since it uses less digits than its factorization.
10306450504 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 184043772 (or 184043768 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 28.
The spelling of 10306450504 in words is "ten billion, three hundred six million, four hundred fifty thousand, five hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •