Base | Representation |
---|---|
bin | 100000111100111100101… |
… | …100101110010110010100 |
3 | 22000110222112111212000112 |
4 | 200330330230232112110 |
5 | 244100111311402012 |
6 | 4452140435502152 |
7 | 322413403311014 |
oct | 40747454562624 |
9 | 8013875455015 |
10 | 2264466122132 |
11 | 7a339a100775 |
12 | 306a51157958 |
13 | 1356cc685136 |
14 | 7b85a631c44 |
15 | 3dd85d00122 |
hex | 20f3cb2e594 |
2264466122132 has 6 divisors (see below), whose sum is σ = 3962815713738. Its totient is φ = 1132233061064.
The previous prime is 2264466122131. The next prime is 2264466122179. The reversal of 2264466122132 is 2312216644622.
2264466122132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 1324718129296 + 939747992836 = 1150964^2 + 969406^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 2264466122132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2264466122131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 283058265263 + ... + 283058265270.
It is an arithmetic number, because the mean of its divisors is an integer number (660469285623).
Almost surely, 22264466122132 is an apocalyptic number.
It is an amenable number.
2264466122132 is a deficient number, since it is larger than the sum of its proper divisors (1698349591606).
2264466122132 is a wasteful number, since it uses less digits than its factorization.
2264466122132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566116530537 (or 566116530535 counting only the distinct ones).
The product of its digits is 331776, while the sum is 41.
The spelling of 2264466122132 in words is "two trillion, two hundred sixty-four billion, four hundred sixty-six million, one hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •