Base | Representation |
---|---|
bin | 110001000001000111111101… |
… | …1101010000111010000100110 |
3 | 2002112121210100001110021011121 |
4 | 1202002033323222013100212 |
5 | 423003134014120031200 |
6 | 4125001332350524154 |
7 | 156550335441630634 |
oct | 14202177352072046 |
9 | 2075553301407147 |
10 | 431163104064550 |
11 | 115422277933400 |
12 | 4043636b20665a |
13 | 15677677311520 |
14 | 7868596cc6354 |
15 | 34ca81d8a8e1a |
hex | 18823fba87426 |
431163104064550 has 144 divisors (see below), whose sum is σ = 990578495481120. Its totient is φ = 138433638182400.
The previous prime is 431163104064493. The next prime is 431163104064551. The reversal of 431163104064550 is 55460401361134.
It is a junction number, because it is equal to n+sod(n) for n = 431163104064497 and 431163104064506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (431163104064551) 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 71 ways as a sum of consecutive naturals, for example, 117366015 + ... + 120983914.
It is an arithmetic number, because the mean of its divisors is an integer number (6879017329730).
Almost surely, 2431163104064550 is an apocalyptic number.
431163104064550 is an abundant number, since it is smaller than the sum of its proper divisors (559415391416570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
431163104064550 is a wasteful number, since it uses less digits than its factorization.
431163104064550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238349999 (or 238349983 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 43.
The spelling of 431163104064550 in words is "four hundred thirty-one trillion, one hundred sixty-three billion, one hundred four million, sixty-four thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •