Base | Representation |
---|---|
bin | 100110111101110011011… |
… | …0101011101000100101101 |
3 | 200221222020011201112111222 |
4 | 1031323212311131010231 |
5 | 1200220330404220323 |
6 | 15220123203153125 |
7 | 1061625566054204 |
oct | 115734665350455 |
9 | 20858204645458 |
10 | 5355402023213 |
11 | 1785238910900 |
12 | 725ab53757a5 |
13 | 2cb020b90918 |
14 | 1472ba84a23b |
15 | 9448db3e9c8 |
hex | 4dee6d5d12d |
5355402023213 has 6 divisors (see below), whose sum is σ = 5886516273582. Its totient is φ = 4868547293720.
The previous prime is 5355402023173. The next prime is 5355402023261. The reversal of 5355402023213 is 3123202045535.
It can be written as a sum of positive squares in only one way, i.e., 4203328240804 + 1152073782409 = 2050202^2 + 1073347^2 .
It is a de Polignac number, because none of the positive numbers 2k-5355402023213 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5355402025213) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 22129760306 + ... + 22129760547.
It is an arithmetic number, because the mean of its divisors is an integer number (981086045597).
Almost surely, 25355402023213 is an apocalyptic number.
It is an amenable number.
5355402023213 is a deficient number, since it is larger than the sum of its proper divisors (531114250369).
5355402023213 is a wasteful number, since it uses less digits than its factorization.
5355402023213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44259520875 (or 44259520864 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 35.
Adding to 5355402023213 its reverse (3123202045535), we get a palindrome (8478604068748).
The spelling of 5355402023213 in words is "five trillion, three hundred fifty-five billion, four hundred two million, twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •