Base | Representation |
---|---|
bin | 111000011111011110… |
… | …1000000011000000001 |
3 | 102121010200001221111222 |
4 | 1300332331000120001 |
5 | 3441423201422001 |
6 | 131421555044425 |
7 | 11523206505221 |
oct | 1607675003001 |
9 | 377120057458 |
10 | 121315264001 |
11 | 474a4338468 |
12 | 1b6182a0715 |
13 | b594837ba9 |
14 | 5c2bcbc081 |
15 | 32506ad61b |
hex | 1c3ef40601 |
121315264001 has 2 divisors, whose sum is σ = 121315264002. Its totient is φ = 121315264000.
The previous prime is 121315263997. The next prime is 121315264019. The reversal of 121315264001 is 100462513121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64413932401 + 56901331600 = 253799^2 + 238540^2 .
It is an emirp because it is prime and its reverse (100462513121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 121315264001 - 22 = 121315263997 is a prime.
It is a super-3 number, since 3×1213152640013 (a number of 34 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (121315284001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60657632000 + 60657632001.
It is an arithmetic number, because the mean of its divisors is an integer number (60657632001).
Almost surely, 2121315264001 is an apocalyptic number.
It is an amenable number.
121315264001 is a deficient number, since it is larger than the sum of its proper divisors (1).
121315264001 is an equidigital number, since it uses as much as digits as its factorization.
121315264001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 121315264001 its reverse (100462513121), we get a palindrome (221777777122).
The spelling of 121315264001 in words is "one hundred twenty-one billion, three hundred fifteen million, two hundred sixty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •