Base | Representation |
---|---|
bin | 100011011000100011011… |
… | …001000001110101111011 |
3 | 22121110020120101010021121 |
4 | 203120203121001311323 |
5 | 304314301041100433 |
6 | 5101011513250111 |
7 | 340446646430311 |
oct | 43304331016573 |
9 | 8543216333247 |
10 | 2431545253243 |
11 | 8582379a5907 |
12 | 3332bb703937 |
13 | 1483a8442722 |
14 | 8598a3c00b1 |
15 | 433b3ed7c2d |
hex | 23623641d7b |
2431545253243 has 4 divisors (see below), whose sum is σ = 2509982196928. Its totient is φ = 2353108309560.
The previous prime is 2431545253217. The next prime is 2431545253261. The reversal of 2431545253243 is 3423525451342.
2431545253243 is digitally balanced in base 2, 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 2431545253243 - 229 = 2431008382331 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2431545253243.
It is not an unprimeable number, because it can be changed into a prime (2431545223243) 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, 39218471796 + ... + 39218471857.
It is an arithmetic number, because the mean of its divisors is an integer number (627495549232).
Almost surely, 22431545253243 is an apocalyptic number.
2431545253243 is a deficient number, since it is larger than the sum of its proper divisors (78436943685).
2431545253243 is an equidigital number, since it uses as much as digits as its factorization.
2431545253243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78436943684.
The product of its digits is 1728000, while the sum is 43.
The spelling of 2431545253243 in words is "two trillion, four hundred thirty-one billion, five hundred forty-five million, two hundred fifty-three thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •