Base | Representation |
---|---|
bin | 1110110100001101000… |
… | …0011110100000111111 |
3 | 220022222201212001001210 |
4 | 3231003100132200333 |
5 | 13132240023310411 |
6 | 312532524335503 |
7 | 24250345511553 |
oct | 3550320364077 |
9 | 808881761053 |
10 | 254531463231 |
11 | 98a45414691 |
12 | 413b60a4593 |
13 | 1b004b30696 |
14 | c46858b863 |
15 | 694aa6eca6 |
hex | 3b4341e83f |
254531463231 has 4 divisors (see below), whose sum is σ = 339375284312. Its totient is φ = 169687642152.
The previous prime is 254531463169. The next prime is 254531463259. The reversal of 254531463231 is 132364135452.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 254531463231 - 26 = 254531463167 is a prime.
It is a super-2 number, since 2×2545314632312 (a number of 24 digits) contains 22 as substring.
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 254531463231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (254531463271) 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, 42421910536 + ... + 42421910541.
It is an arithmetic number, because the mean of its divisors is an integer number (84843821078).
Almost surely, 2254531463231 is an apocalyptic number.
254531463231 is a deficient number, since it is larger than the sum of its proper divisors (84843821081).
254531463231 is an equidigital number, since it uses as much as digits as its factorization.
254531463231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84843821080.
The product of its digits is 259200, while the sum is 39.
Adding to 254531463231 its reverse (132364135452), we get a palindrome (386895598683).
The spelling of 254531463231 in words is "two hundred fifty-four billion, five hundred thirty-one million, four hundred sixty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •