Base | Representation |
---|---|
bin | 100111100010100011011… |
… | …1110001111111111101101 |
3 | 201020111221102000021220112 |
4 | 1033011012332033333231 |
5 | 1203013444013244010 |
6 | 15320254422425405 |
7 | 1100421423564152 |
oct | 117050676177755 |
9 | 21214842007815 |
10 | 5434324353005 |
11 | 1805758474349 |
12 | 739260292265 |
13 | 3055ba962752 |
14 | 14b04641a229 |
15 | 9655c6d8a05 |
hex | 4f146f8ffed |
5434324353005 has 8 divisors (see below), whose sum is σ = 6549177161592. Its totient is φ = 4328800857088.
The previous prime is 5434324352939. The next prime is 5434324353023. The reversal of 5434324353005 is 5003534234345.
5434324353005 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 1471652855689 + 3962671497316 = 1213117^2 + 1990646^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5434324353005 - 212 = 5434324348909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2332326884 + ... + 2332329213.
It is an arithmetic number, because the mean of its divisors is an integer number (818647145199).
Almost surely, 25434324353005 is an apocalyptic number.
It is an amenable number.
5434324353005 is a deficient number, since it is larger than the sum of its proper divisors (1114852808587).
5434324353005 is a wasteful number, since it uses less digits than its factorization.
5434324353005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4664656335.
The product of its (nonzero) digits is 1296000, while the sum is 41.
The spelling of 5434324353005 in words is "five trillion, four hundred thirty-four billion, three hundred twenty-four million, three hundred fifty-three thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •