Base | Representation |
---|---|
bin | 11010110111001… |
… | …010111001001001 |
3 | 1011102000102020011 |
4 | 122313022321021 |
5 | 1410332421103 |
6 | 112415231521 |
7 | 14111430103 |
oct | 3267127111 |
9 | 1142012204 |
10 | 450670153 |
11 | 21143417a |
12 | 106b185a1 |
13 | 724a2a3b |
14 | 43bd4573 |
15 | 29871d6d |
hex | 1adcae49 |
450670153 has 4 divisors (see below), whose sum is σ = 477180180. Its totient is φ = 424160128.
The previous prime is 450670123. The next prime is 450670159. The reversal of 450670153 is 351076054.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 313006864 + 137663289 = 17692^2 + 11733^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-450670153 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (450670159) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13254988 + ... + 13255021.
It is an arithmetic number, because the mean of its divisors is an integer number (119295045).
Almost surely, 2450670153 is an apocalyptic number.
It is an amenable number.
450670153 is a deficient number, since it is larger than the sum of its proper divisors (26510027).
450670153 is a wasteful number, since it uses less digits than its factorization.
450670153 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26510026.
The product of its (nonzero) digits is 12600, while the sum is 31.
The square root of 450670153 is about 21228.9932168250. The cubic root of 450670153 is about 766.6896470952.
The spelling of 450670153 in words is "four hundred fifty million, six hundred seventy thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •