Base | Representation |
---|---|
bin | 100110111100111001010… |
… | …1010101110100110001111 |
3 | 200221210012100101122212001 |
4 | 1031321302222232212033 |
5 | 1200202332440214401 |
6 | 15215201542053131 |
7 | 1061526362103223 |
oct | 115716252564617 |
9 | 20853170348761 |
10 | 5353453054351 |
11 | 1784428759736 |
12 | 72565071a1a7 |
13 | 2caaa01730cc |
14 | 147173a76783 |
15 | 943c79ac601 |
hex | 4de72aae98f |
5353453054351 has 4 divisors (see below), whose sum is σ = 5353945971304. Its totient is φ = 5352960137400.
The previous prime is 5353453054333. The next prime is 5353453054357. The reversal of 5353453054351 is 1534503543535.
5353453054351 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 5353453054351 - 27 = 5353453054223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5353453054357) 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, 246442185 + ... + 246463906.
It is an arithmetic number, because the mean of its divisors is an integer number (1338486492826).
Almost surely, 25353453054351 is an apocalyptic number.
5353453054351 is a deficient number, since it is larger than the sum of its proper divisors (492916953).
5353453054351 is a wasteful number, since it uses less digits than its factorization.
5353453054351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 492916952.
The product of its (nonzero) digits is 4050000, while the sum is 46.
Adding to 5353453054351 its reverse (1534503543535), we get a palindrome (6887956597886).
The spelling of 5353453054351 in words is "five trillion, three hundred fifty-three billion, four hundred fifty-three million, fifty-four thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •