Base | Representation |
---|---|
bin | 11000101100011111010101… |
… | …10001010010101011010111 |
3 | 21010021112020110220100011122 |
4 | 30112033222301102223113 |
5 | 24104214032320012211 |
6 | 311255245203354155 |
7 | 14303264510325020 |
oct | 1426175261225327 |
9 | 233245213810148 |
10 | 54305210313431 |
11 | 1633778a540610 |
12 | 611086908295b |
13 | 243bc619345bc |
14 | d5a559a55c47 |
15 | 64290a9256db |
hex | 3163eac52ad7 |
54305210313431 has 16 divisors (see below), whose sum is σ = 67706165442048. Its totient is φ = 42315143191200.
The previous prime is 54305210313391. The next prime is 54305210313433. The reversal of 54305210313431 is 13431301250345.
It is not a de Polignac number, because 54305210313431 - 222 = 54305206119127 is a prime.
It is a super-2 number, since 2×543052103134312 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 54305210313391 and 54305210313400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54305210313433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 415241 + ... + 10429901.
It is an arithmetic number, because the mean of its divisors is an integer number (4231635340128).
Almost surely, 254305210313431 is an apocalyptic number.
54305210313431 is a deficient number, since it is larger than the sum of its proper divisors (13400955128617).
54305210313431 is a wasteful number, since it uses less digits than its factorization.
54305210313431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10085102.
The product of its (nonzero) digits is 64800, while the sum is 35.
Adding to 54305210313431 its reverse (13431301250345), we get a palindrome (67736511563776).
The spelling of 54305210313431 in words is "fifty-four trillion, three hundred five billion, two hundred ten million, three hundred thirteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •