Base | Representation |
---|---|
bin | 110011001110110001100110… |
… | …1010011001001010000000111 |
3 | 2012002112221102222110102102112 |
4 | 1212131203031103021100013 |
5 | 433031121113214403411 |
6 | 4234225114021131235 |
7 | 163630021334602016 |
oct | 14635431523112007 |
9 | 2162487388412375 |
10 | 450631413044231 |
11 | 1206487887aa361 |
12 | 4265b478559b1b |
13 | 1645a48a95b163 |
14 | 7d3c96908aa7d |
15 | 3716e55804b8b |
hex | 199d8cd4c9407 |
450631413044231 has 32 divisors (see below), whose sum is σ = 457608918009600. Its totient is φ = 443721008067840.
The previous prime is 450631413044227. The next prime is 450631413044269. The reversal of 450631413044231 is 132440314136054.
It is a cyclic number.
It is not a de Polignac number, because 450631413044231 - 22 = 450631413044227 is a prime.
It is a super-2 number, since 2×4506314130442312 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (450631413046231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20594633411 + ... + 20594655291.
It is an arithmetic number, because the mean of its divisors is an integer number (14300278687800).
Almost surely, 2450631413044231 is an apocalyptic number.
450631413044231 is a deficient number, since it is larger than the sum of its proper divisors (6977504965369).
450631413044231 is a wasteful number, since it uses less digits than its factorization.
450631413044231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24239.
The product of its (nonzero) digits is 414720, while the sum is 41.
The spelling of 450631413044231 in words is "four hundred fifty trillion, six hundred thirty-one billion, four hundred thirteen million, forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •