Base | Representation |
---|---|
bin | 1101000111000100100… |
… | …10111110010000110111 |
3 | 1121001202020211202211201 |
4 | 12203202102332100313 |
5 | 24340032121120343 |
6 | 542540004313331 |
7 | 44355101135212 |
oct | 6434222762067 |
9 | 1531666752751 |
10 | 450473223223 |
11 | 164054433021 |
12 | 7337a6a2847 |
13 | 336304492ba |
14 | 17b356b8779 |
15 | bab7ab794d |
hex | 68e24be437 |
450473223223 has 8 divisors (see below), whose sum is σ = 467228854080. Its totient is φ = 433958680800.
The previous prime is 450473223203. The next prime is 450473223271. The reversal of 450473223223 is 322322374054.
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 450473223223 - 221 = 450471126071 is a prime.
It is a super-2 number, since 2×4504732232232 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450473223203) 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, 60268303 + ... + 60275776.
It is an arithmetic number, because the mean of its divisors is an integer number (58403606760).
Almost surely, 2450473223223 is an apocalyptic number.
450473223223 is a deficient number, since it is larger than the sum of its proper divisors (16755630857).
450473223223 is a wasteful number, since it uses less digits than its factorization.
450473223223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120544217.
The product of its (nonzero) digits is 241920, while the sum is 37.
Adding to 450473223223 its reverse (322322374054), we get a palindrome (772795597277).
The spelling of 450473223223 in words is "four hundred fifty billion, four hundred seventy-three million, two hundred twenty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •