Base | Representation |
---|---|
bin | 10010011111111101110… |
… | …110100011101110010000 |
3 | 11111112101021212012012100 |
4 | 102133331312203232100 |
5 | 131312032204240224 |
6 | 2412003152000400 |
7 | 160563235113042 |
oct | 22377566435620 |
9 | 4445337765170 |
10 | 1271274290064 |
11 | 450165216149 |
12 | 18646b230100 |
13 | 92b5aa37c3c |
14 | 4575c48ba92 |
15 | 2310710dac9 |
hex | 127fdda3b90 |
1271274290064 has 135 divisors (see below), whose sum is σ = 3780079509297. Its totient is φ = 398758989312.
The previous prime is 1271274290023. The next prime is 1271274290087. The reversal of 1271274290064 is 4600924721721.
The square root of 1271274290064 is 1127508.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 989746419600 + 281527870464 = 994860^2 + 530592^2 .
It is a super-2 number, since 2×12712742900642 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 230008869 + ... + 230014395.
Almost surely, 21271274290064 is an apocalyptic number.
1271274290064 is the 1127508-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1271274290064
1271274290064 is an abundant number, since it is smaller than the sum of its proper divisors (2508805219233).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1271274290064 is an frugal number, since it uses more digits than its factorization.
1271274290064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11102 (or 5549 counting only the distinct ones).
The product of its (nonzero) digits is 338688, while the sum is 45.
The spelling of 1271274290064 in words is "one trillion, two hundred seventy-one billion, two hundred seventy-four million, two hundred ninety thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •