Base | Representation |
---|---|
bin | 1100000001010100… |
… | …10011010110000111 |
3 | 121122202110210220120 |
4 | 12000222103112013 |
5 | 101204101241411 |
6 | 2544213433023 |
7 | 315632121045 |
oct | 60052232607 |
9 | 17582423816 |
10 | 6453540231 |
11 | 2811945326 |
12 | 130133b773 |
13 | 7bb034c78 |
14 | 45314d395 |
15 | 27b875106 |
hex | 180a93587 |
6453540231 has 4 divisors (see below), whose sum is σ = 8604720312. Its totient is φ = 4302360152.
The previous prime is 6453540229. The next prime is 6453540287. The reversal of 6453540231 is 1320453546.
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 6453540231 - 21 = 6453540229 is a prime.
It is a super-2 number, since 2×64535402312 = 83296363026271066722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 6453540192 and 6453540201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6453541231) 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, 1075590036 + ... + 1075590041.
It is an arithmetic number, because the mean of its divisors is an integer number (2151180078).
Almost surely, 26453540231 is an apocalyptic number.
6453540231 is a deficient number, since it is larger than the sum of its proper divisors (2151180081).
6453540231 is a wasteful number, since it uses less digits than its factorization.
6453540231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2151180080.
The product of its (nonzero) digits is 43200, while the sum is 33.
The square root of 6453540231 is about 80333.9295130022. The cubic root of 6453540231 is about 1861.7984907973.
Adding to 6453540231 its reverse (1320453546), we get a palindrome (7773993777).
The spelling of 6453540231 in words is "six billion, four hundred fifty-three million, five hundred forty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •