Base | Representation |
---|---|
bin | 10000110000001001101… |
… | …101011001100011001001 |
3 | 11002001111002111012112021 |
4 | 100300021231121203021 |
5 | 122330141304201101 |
6 | 2240505510044441 |
7 | 146113105442665 |
oct | 20601155314311 |
9 | 4061432435467 |
10 | 1151214131401 |
11 | 404255401a24 |
12 | 167143349721 |
13 | 84736249639 |
14 | 3da0d1658a5 |
15 | 1ee2bc235a1 |
hex | 10c09b598c9 |
1151214131401 has 2 divisors, whose sum is σ = 1151214131402. Its totient is φ = 1151214131400.
The previous prime is 1151214131399. The next prime is 1151214131407. The reversal of 1151214131401 is 1041314121511.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 834893375625 + 316320755776 = 913725^2 + 562424^2 .
It is a cyclic number.
It is not a de Polignac number, because 1151214131401 - 21 = 1151214131399 is a prime.
Together with 1151214131399, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1151214131407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 575607065700 + 575607065701.
It is an arithmetic number, because the mean of its divisors is an integer number (575607065701).
Almost surely, 21151214131401 is an apocalyptic number.
It is an amenable number.
1151214131401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1151214131401 is an equidigital number, since it uses as much as digits as its factorization.
1151214131401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 25.
Adding to 1151214131401 its reverse (1041314121511), we get a palindrome (2192528252912).
The spelling of 1151214131401 in words is "one trillion, one hundred fifty-one billion, two hundred fourteen million, one hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •