Base | Representation |
---|---|
bin | 1101000110010010010… |
… | …00101100111101010111 |
3 | 1121000122211112201022220 |
4 | 12203021020230331113 |
5 | 24333201040204003 |
6 | 542430044553423 |
7 | 44341454143554 |
oct | 6431110547527 |
9 | 1530584481286 |
10 | 450051100503 |
11 | 163958127a74 |
12 | 73281252873 |
13 | 33593b60344 |
14 | 17ad55d5a2b |
15 | ba909d4353 |
hex | 68c922cf57 |
450051100503 has 4 divisors (see below), whose sum is σ = 600068134008. Its totient is φ = 300034067000.
The previous prime is 450051100501. The next prime is 450051100517. The reversal of 450051100503 is 305001150054.
450051100503 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 450051100503 - 21 = 450051100501 is a prime.
It is a super-2 number, since 2×4500511005032 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450051100501) 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, 75008516748 + ... + 75008516753.
It is an arithmetic number, because the mean of its divisors is an integer number (150017033502).
Almost surely, 2450051100503 is an apocalyptic number.
450051100503 is a deficient number, since it is larger than the sum of its proper divisors (150017033505).
450051100503 is a wasteful number, since it uses less digits than its factorization.
450051100503 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150017033504.
The product of its (nonzero) digits is 1500, while the sum is 24.
Adding to 450051100503 its reverse (305001150054), we get a palindrome (755052250557).
The spelling of 450051100503 in words is "four hundred fifty billion, fifty-one million, one hundred thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •