Base | Representation |
---|---|
bin | 10100000010101101010… |
… | …000100001110110110111 |
3 | 11212200001011000122211200 |
4 | 110002231100201312313 |
5 | 140031200324413241 |
6 | 2532415440103543 |
7 | 201335454415611 |
oct | 24025520416667 |
9 | 4780034018750 |
10 | 1377296326071 |
11 | 491120963006 |
12 | 1a2b19904bb3 |
13 | 9cb5605a4a3 |
14 | 4a939215db1 |
15 | 25c5ed854b6 |
hex | 140ad421db7 |
1377296326071 has 12 divisors (see below), whose sum is σ = 1995703828872. Its totient is φ = 915301026576.
The previous prime is 1377296326019. The next prime is 1377296326139. The reversal of 1377296326071 is 1706236927731.
1377296326071 is a `hidden beast` number, since 1 + 3 + 7 + 7 + 29 + 6 + 3 + 2 + 607 + 1 = 666.
It is not a de Polignac number, because 1377296326071 - 225 = 1377262771639 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1377296325999 and 1377296326017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1377296326171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 241374001 + ... + 241379706.
It is an arithmetic number, because the mean of its divisors is an integer number (166308652406).
Almost surely, 21377296326071 is an apocalyptic number.
1377296326071 is a deficient number, since it is larger than the sum of its proper divisors (618407502801).
1377296326071 is a wasteful number, since it uses less digits than its factorization.
1377296326071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 482754030 (or 482754027 counting only the distinct ones).
The product of its (nonzero) digits is 4000752, while the sum is 54.
The spelling of 1377296326071 in words is "one trillion, three hundred seventy-seven billion, two hundred ninety-six million, three hundred twenty-six thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •