Base | Representation |
---|---|
bin | 100111110000000110110… |
… | …011110011110110010010 |
3 | 100200011000210210012002220 |
4 | 213300012303303312102 |
5 | 324224022120222031 |
6 | 5450533135321510 |
7 | 401234256111501 |
oct | 47600663636622 |
9 | 10604023705086 |
10 | 2731713445266 |
11 | 96357102a283 |
12 | 381511380296 |
13 | 16a7a406c730 |
14 | 963039c4838 |
15 | 4b0d131b596 |
hex | 27c06cf3d92 |
2731713445266 has 64 divisors (see below), whose sum is σ = 6091973193600. Its totient is φ = 810823942656.
The previous prime is 2731713445261. The next prime is 2731713445319. The reversal of 2731713445266 is 6625443171372.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2731713445261) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2018965 + ... + 3088631.
It is an arithmetic number, because the mean of its divisors is an integer number (95187081150).
Almost surely, 22731713445266 is an apocalyptic number.
2731713445266 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 2731713445266, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3045986596800).
2731713445266 is an abundant number, since it is smaller than the sum of its proper divisors (3360259748334).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2731713445266 is a wasteful number, since it uses less digits than its factorization.
2731713445266 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1070843.
The product of its digits is 5080320, while the sum is 51.
The spelling of 2731713445266 in words is "two trillion, seven hundred thirty-one billion, seven hundred thirteen million, four hundred forty-five thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •