Base | Representation |
---|---|
bin | 100111100010111100000… |
… | …1111101101000100000101 |
3 | 201020121002000111221000002 |
4 | 1033011320033231010011 |
5 | 1203022142124341401 |
6 | 15320512432531045 |
7 | 1100451052223036 |
oct | 117057017550405 |
9 | 21217060457002 |
10 | 5435151012101 |
11 | 1806042063588 |
12 | 7394510b0a85 |
13 | 3056bccbaa45 |
14 | 14b0c4124a8d |
15 | 965aa079a6b |
hex | 4f1783ed105 |
5435151012101 has 2 divisors, whose sum is σ = 5435151012102. Its totient is φ = 5435151012100.
The previous prime is 5435151012097. The next prime is 5435151012103. The reversal of 5435151012101 is 1012101515345.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5178578371201 + 256572640900 = 2275649^2 + 506530^2 .
It is a cyclic number.
It is not a de Polignac number, because 5435151012101 - 22 = 5435151012097 is a prime.
Together with 5435151012103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5435151012103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2717575506050 + 2717575506051.
It is an arithmetic number, because the mean of its divisors is an integer number (2717575506051).
Almost surely, 25435151012101 is an apocalyptic number.
It is an amenable number.
5435151012101 is a deficient number, since it is larger than the sum of its proper divisors (1).
5435151012101 is an equidigital number, since it uses as much as digits as its factorization.
5435151012101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3000, while the sum is 29.
Adding to 5435151012101 its reverse (1012101515345), we get a palindrome (6447252527446).
The spelling of 5435151012101 in words is "five trillion, four hundred thirty-five billion, one hundred fifty-one million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •