Base | Representation |
---|---|
bin | 100110101001101100111… |
… | …0010110100010111111011 |
3 | 200210211210200122011100122 |
4 | 1031103121302310113323 |
5 | 1144013423242233301 |
6 | 15144223441123455 |
7 | 1055540046123104 |
oct | 115233162642773 |
9 | 20724720564318 |
10 | 5312233555451 |
11 | 17689a6397069 |
12 | 71966832958b |
13 | 2c6c31560084 |
14 | 1451835413ab |
15 | 932b3dd781b |
hex | 4d4d9cb45fb |
5312233555451 has 8 divisors (see below), whose sum is σ = 5399923789008. Its totient is φ = 5224562820000.
The previous prime is 5312233555417. The next prime is 5312233555477. The reversal of 5312233555451 is 1545553322135.
5312233555451 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5312233555451 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5312233555411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4324625 + ... + 5415426.
It is an arithmetic number, because the mean of its divisors is an integer number (674990473626).
Almost surely, 25312233555451 is an apocalyptic number.
5312233555451 is a deficient number, since it is larger than the sum of its proper divisors (87690233557).
5312233555451 is an equidigital number, since it uses as much as digits as its factorization.
5312233555451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9749053.
The product of its digits is 1350000, while the sum is 44.
Adding to 5312233555451 its reverse (1545553322135), we get a palindrome (6857786877586).
The spelling of 5312233555451 in words is "five trillion, three hundred twelve billion, two hundred thirty-three million, five hundred fifty-five thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •