Base | Representation |
---|---|
bin | 1101000110011100001… |
… | …10000110101000010110 |
3 | 1121000212122002221212010 |
4 | 12203032012012220112 |
5 | 24333333340232202 |
6 | 542442220205050 |
7 | 44343514315263 |
oct | 6431606065026 |
9 | 1530778087763 |
10 | 450134305302 |
11 | 1639a0097a70 |
12 | 732a5099786 |
13 | 335a8173356 |
14 | 17b0269426a |
15 | ba97e6c76c |
hex | 68ce186a16 |
450134305302 has 32 divisors (see below), whose sum is σ = 988366719744. Its totient is φ = 135535514400.
The previous prime is 450134305301. The next prime is 450134305391. The reversal of 450134305302 is 203503431054.
It is a super-2 number, since 2×4501343053022 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 450134305302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450134305301) 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 15 ways as a sum of consecutive naturals, for example, 21710074 + ... + 21730797.
It is an arithmetic number, because the mean of its divisors is an integer number (30886459992).
Almost surely, 2450134305302 is an apocalyptic number.
450134305302 is an abundant number, since it is smaller than the sum of its proper divisors (538232414442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
450134305302 is a wasteful number, since it uses less digits than its factorization.
450134305302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43441044.
The product of its (nonzero) digits is 21600, while the sum is 30.
Adding to 450134305302 its reverse (203503431054), we get a palindrome (653637736356).
The spelling of 450134305302 in words is "four hundred fifty billion, one hundred thirty-four million, three hundred five thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •