Base | Representation |
---|---|
bin | 100111011000001111100… |
… | …1010111110110001010101 |
3 | 201011101210020211021202002 |
4 | 1032300133022332301111 |
5 | 1202133122012441310 |
6 | 15302153314125045 |
7 | 1066005623646455 |
oct | 116603712766125 |
9 | 21141706737662 |
10 | 5412181765205 |
11 | 17a7325569406 |
12 | 734b00880785 |
13 | 30349c4085a7 |
14 | 149d4575dd65 |
15 | 95bb37e1da5 |
hex | 4ec1f2bec55 |
5412181765205 has 32 divisors (see below), whose sum is σ = 6847852105728. Its totient is φ = 4100273222400.
The previous prime is 5412181765201. The next prime is 5412181765229. The reversal of 5412181765205 is 5025671812145.
It is not a de Polignac number, because 5412181765205 - 22 = 5412181765201 is a prime.
It is a super-2 number, since 2×54121817652052 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5412181765205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5412181765201) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 48469619 + ... + 48581151.
It is an arithmetic number, because the mean of its divisors is an integer number (213995378304).
Almost surely, 25412181765205 is an apocalyptic number.
It is an amenable number.
5412181765205 is a deficient number, since it is larger than the sum of its proper divisors (1435670340523).
5412181765205 is a wasteful number, since it uses less digits than its factorization.
5412181765205 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 118277.
The product of its (nonzero) digits is 672000, while the sum is 47.
The spelling of 5412181765205 in words is "five trillion, four hundred twelve billion, one hundred eighty-one million, seven hundred sixty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •