Base | Representation |
---|---|
bin | 110001000000110011111010… |
… | …0111101111010111000001001 |
3 | 2002112110200011222212000021012 |
4 | 1202001213310331322320021 |
5 | 423001432321242040431 |
6 | 4124525451352253305 |
7 | 156544252354425563 |
oct | 14201476475727011 |
9 | 2075420158760235 |
10 | 431120042143241 |
11 | 115405a8a571590 |
12 | 40429b519a1235 |
13 | 156735a3aa7109 |
14 | 786646dbd4333 |
15 | 34c964d19b22b |
hex | 18819f4f7ae09 |
431120042143241 has 32 divisors (see below), whose sum is σ = 480785048430336. Its totient is φ = 383250046816000.
The previous prime is 431120042143237. The next prime is 431120042143291. The reversal of 431120042143241 is 142341240021134.
It is a cyclic number.
It is not a de Polignac number, because 431120042143241 - 22 = 431120042143237 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 431120042143198 and 431120042143207.
It is not an unprimeable number, because it can be changed into a prime (431120042143201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1558609571 + ... + 1558886151.
It is an arithmetic number, because the mean of its divisors is an integer number (15024532763448).
Almost surely, 2431120042143241 is an apocalyptic number.
It is an amenable number.
431120042143241 is a deficient number, since it is larger than the sum of its proper divisors (49665006287095).
431120042143241 is a wasteful number, since it uses less digits than its factorization.
431120042143241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285553.
The product of its (nonzero) digits is 18432, while the sum is 32.
Adding to 431120042143241 its reverse (142341240021134), we get a palindrome (573461282164375).
The spelling of 431120042143241 in words is "four hundred thirty-one trillion, one hundred twenty billion, forty-two million, one hundred forty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •