Base | Representation |
---|---|
bin | 10010010100110… |
… | …110000001110110 |
3 | 210102112021200210 |
4 | 102110312001312 |
5 | 1112202012240 |
6 | 50301450250 |
7 | 10422213360 |
oct | 2224660166 |
9 | 712467623 |
10 | 307454070 |
11 | 148605880 |
12 | 86b70986 |
13 | 4b90a8b1 |
14 | 2cb93d30 |
15 | 1bed2780 |
hex | 12536076 |
307454070 has 64 divisors (see below), whose sum is σ = 919973376. Its totient is φ = 63886080.
The previous prime is 307454057. The next prime is 307454071. The reversal of 307454070 is 70454703.
307454070 is digitally balanced in base 3, 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 (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (307454071) 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 31 ways as a sum of consecutive naturals, for example, 64239 + ... + 68858.
It is an arithmetic number, because the mean of its divisors is an integer number (14374584).
Almost surely, 2307454070 is an apocalyptic number.
307454070 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
307454070 is an abundant number, since it is smaller than the sum of its proper divisors (612519306).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
307454070 is a wasteful number, since it uses less digits than its factorization.
307454070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133125.
The product of its (nonzero) digits is 11760, while the sum is 30.
The square root of 307454070 is about 17534.3682520928. The cubic root of 307454070 is about 674.9320974219.
The spelling of 307454070 in words is "three hundred seven million, four hundred fifty-four thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •