Base | Representation |
---|---|
bin | 1001000101101111011… |
… | …10011101001111100011 |
3 | 1002212011010021121222102 |
4 | 10202313232131033203 |
5 | 20104112413213433 |
6 | 355251114401015 |
7 | 31364403442001 |
oct | 4426756351743 |
9 | 1085133247872 |
10 | 312320054243 |
11 | 1104aa58a40a |
12 | 5064343016b |
13 | 235b4393232 |
14 | 1118b473a71 |
15 | 81ce0a04e8 |
hex | 48b7b9d3e3 |
312320054243 has 4 divisors (see below), whose sum is σ = 312386808240. Its totient is φ = 312253300248.
The previous prime is 312320054237. The next prime is 312320054287. The reversal of 312320054243 is 342450023213.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 342450023213 = 1259 ⋅272001607.
It is a cyclic number.
It is not a de Polignac number, because 312320054243 - 220 = 312319005667 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (312320954243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33369980 + ... + 33379337.
It is an arithmetic number, because the mean of its divisors is an integer number (78096702060).
Almost surely, 2312320054243 is an apocalyptic number.
312320054243 is a deficient number, since it is larger than the sum of its proper divisors (66753997).
312320054243 is an equidigital number, since it uses as much as digits as its factorization.
312320054243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66753996.
The product of its (nonzero) digits is 17280, while the sum is 29.
Adding to 312320054243 its reverse (342450023213), we get a palindrome (654770077456).
The spelling of 312320054243 in words is "three hundred twelve billion, three hundred twenty million, fifty-four thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •