Base | Representation |
---|---|
bin | 1011111100000000000101… |
… | …1111100111010001000101 |
3 | 1201110210001211121221200112 |
4 | 2333000001133213101011 |
5 | 3210021402422333333 |
6 | 43525425104522405 |
7 | 2523165523500404 |
oct | 277000137472105 |
9 | 51423054557615 |
10 | 13125445121093 |
11 | 4200519655998 |
12 | 157b971020405 |
13 | 742954cb0416 |
14 | 3353bc5bb63b |
15 | 17b6526bb948 |
hex | bf0017e7445 |
13125445121093 has 2 divisors, whose sum is σ = 13125445121094. Its totient is φ = 13125445121092.
The previous prime is 13125445121077. The next prime is 13125445121119. The reversal of 13125445121093 is 39012154452131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6996146670529 + 6129298450564 = 2645023^2 + 2475742^2 .
It is a cyclic number.
It is not a de Polignac number, because 13125445121093 - 24 = 13125445121077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13125445121093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13125445121693) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6562722560546 + 6562722560547.
It is an arithmetic number, because the mean of its divisors is an integer number (6562722560547).
Almost surely, 213125445121093 is an apocalyptic number.
It is an amenable number.
13125445121093 is a deficient number, since it is larger than the sum of its proper divisors (1).
13125445121093 is an equidigital number, since it uses as much as digits as its factorization.
13125445121093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129600, while the sum is 41.
The spelling of 13125445121093 in words is "thirteen trillion, one hundred twenty-five billion, four hundred forty-five million, one hundred twenty-one thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •