Base | Representation |
---|---|
bin | 1101000111000111110… |
… | …11000100100110001111 |
3 | 1121001211011012012012110 |
4 | 12203203323010212033 |
5 | 24340111112342033 |
6 | 542542421235103 |
7 | 44355552112563 |
oct | 6434373044617 |
9 | 1531734165173 |
10 | 450500512143 |
11 | 164068881650 |
12 | 73387862a93 |
13 | 33635cb22a6 |
14 | 17b3917d6a3 |
15 | baba1a8363 |
hex | 68e3ec498f |
450500512143 has 8 divisors (see below), whose sum is σ = 655273472256. Its totient is φ = 273030613400.
The previous prime is 450500512141. The next prime is 450500512153. The reversal of 450500512143 is 341215005054.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 450500512143 - 21 = 450500512141 is a prime.
It is a super-2 number, since 2×4505005121432 (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 450500512143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450500512141) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6825765303 + ... + 6825765368.
It is an arithmetic number, because the mean of its divisors is an integer number (81909184032).
Almost surely, 2450500512143 is an apocalyptic number.
450500512143 is a deficient number, since it is larger than the sum of its proper divisors (204772960113).
450500512143 is a wasteful number, since it uses less digits than its factorization.
450500512143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13651530685.
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 450500512143 its reverse (341215005054), we get a palindrome (791715517197).
The spelling of 450500512143 in words is "four hundred fifty billion, five hundred million, five hundred twelve thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •