Base | Representation |
---|---|
bin | 10010001110001… |
… | …010111100100100 |
3 | 210022020102001210 |
4 | 102032022330210 |
5 | 1111230022430 |
6 | 50200151420 |
7 | 10401306315 |
oct | 2216127444 |
9 | 708212053 |
10 | 305704740 |
11 | 147620550 |
12 | 86468570 |
13 | 4b4475a3 |
14 | 2c85a60c |
15 | 1bc892b0 |
hex | 1238af24 |
305704740 has 48 divisors (see below), whose sum is σ = 933791040. Its totient is φ = 74110080.
The previous prime is 305704717. The next prime is 305704741. The reversal of 305704740 is 47407503.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 305704698 and 305704707.
It is not an unprimeable number, because it can be changed into a prime (305704741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 230935 + ... + 232254.
It is an arithmetic number, because the mean of its divisors is an integer number (19453980).
Almost surely, 2305704740 is an apocalyptic number.
305704740 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
305704740 is an abundant number, since it is smaller than the sum of its proper divisors (628086300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
305704740 is a wasteful number, since it uses less digits than its factorization.
305704740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463212 (or 463210 counting only the distinct ones).
The product of its (nonzero) digits is 11760, while the sum is 30.
The square root of 305704740 is about 17484.4142023689. The cubic root of 305704740 is about 673.6496019926.
The spelling of 305704740 in words is "three hundred five million, seven hundred four thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •