Base | Representation |
---|---|
bin | 100101001011100101010… |
… | …0110000110101110100001 |
3 | 200002112002201002212111112 |
4 | 1022113022212012232201 |
5 | 1132211003431222401 |
6 | 14511315433153105 |
7 | 1035123262452566 |
oct | 112271246065641 |
9 | 20075081085445 |
10 | 5110115101601 |
11 | 16a0207833164 |
12 | 6a645b25b795 |
13 | 2b0b60391613 |
14 | 13948bd6c86d |
15 | 8cdd49a33bb |
hex | 4a5ca986ba1 |
5110115101601 has 2 divisors, whose sum is σ = 5110115101602. Its totient is φ = 5110115101600.
The previous prime is 5110115101591. The next prime is 5110115101621. The reversal of 5110115101601 is 1061015110115.
5110115101601 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3950649165376 + 1159465936225 = 1987624^2 + 1076785^2 .
It is a cyclic number.
It is not a de Polignac number, because 5110115101601 - 26 = 5110115101537 is a prime.
It is a super-2 number, since 2×51101151016012 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5110115101621) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2555057550800 + 2555057550801.
It is an arithmetic number, because the mean of its divisors is an integer number (2555057550801).
Almost surely, 25110115101601 is an apocalyptic number.
It is an amenable number.
5110115101601 is a deficient number, since it is larger than the sum of its proper divisors (1).
5110115101601 is an equidigital number, since it uses as much as digits as its factorization.
5110115101601 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 150, while the sum is 23.
The spelling of 5110115101601 in words is "five trillion, one hundred ten billion, one hundred fifteen million, one hundred one thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •