Base | Representation |
---|---|
bin | 1011100110110011… |
… | …11000100100100101 |
3 | 121002020222022210110 |
4 | 11303121320210211 |
5 | 100230132214303 |
6 | 2510150443233 |
7 | 310261515630 |
oct | 56331704445 |
9 | 17066868713 |
10 | 6231132453 |
11 | 2708348047 |
12 | 125a963519 |
13 | 783c33630 |
14 | 4317b6c17 |
15 | 267091703 |
hex | 173678925 |
6231132453 has 16 divisors (see below), whose sum is σ = 10225448576. Its totient is φ = 3286751040.
The previous prime is 6231132433. The next prime is 6231132487. The reversal of 6231132453 is 3542311326.
It is not a de Polignac number, because 6231132453 - 212 = 6231128357 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 6231132453.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6231132433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11412058 + ... + 11412603.
It is an arithmetic number, because the mean of its divisors is an integer number (639090536).
Almost surely, 26231132453 is an apocalyptic number.
It is an amenable number.
6231132453 is a deficient number, since it is larger than the sum of its proper divisors (3994316123).
6231132453 is a wasteful number, since it uses less digits than its factorization.
6231132453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22824684.
The product of its digits is 12960, while the sum is 30.
The square root of 6231132453 is about 78937.5224655550. The cubic root of 6231132453 is about 1840.1603173364.
Adding to 6231132453 its reverse (3542311326), we get a palindrome (9773443779).
The spelling of 6231132453 in words is "six billion, two hundred thirty-one million, one hundred thirty-two thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •