Base | Representation |
---|---|
bin | 101010110100010… |
… | …1100010001010010 |
3 | 10201010110110122220 |
4 | 1111220230101102 |
5 | 10420300333300 |
6 | 354322041510 |
7 | 50414002341 |
oct | 12550542122 |
9 | 3633413586 |
10 | 1436730450 |
11 | 677aa6941 |
12 | 3411a9296 |
13 | 19b86c07c |
14 | d8b53b58 |
15 | 861ecda0 |
hex | 55a2c452 |
1436730450 has 24 divisors (see below), whose sum is σ = 3563091888. Its totient is φ = 383128080.
The previous prime is 1436730437. The next prime is 1436730457. The reversal of 1436730450 is 540376341.
1436730450 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1436730457) 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 11 ways as a sum of consecutive naturals, for example, 4788952 + ... + 4789251.
It is an arithmetic number, because the mean of its divisors is an integer number (148462162).
Almost surely, 21436730450 is an apocalyptic number.
1436730450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1436730450 is an abundant number, since it is smaller than the sum of its proper divisors (2126361438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1436730450 is a wasteful number, since it uses less digits than its factorization.
1436730450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9578218 (or 9578213 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 33.
The square root of 1436730450 is about 37904.2273368024. The cubic root of 1436730450 is about 1128.3879302380.
The spelling of 1436730450 in words is "one billion, four hundred thirty-six million, seven hundred thirty thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •