Base | Representation |
---|---|
bin | 100110110001010010101… |
… | …001000100001000001000 |
3 | 100102200221021221010220011 |
4 | 212301102221010020020 |
5 | 322122404123020130 |
6 | 5355540315241304 |
7 | 363326000133055 |
oct | 46612251041010 |
9 | 10380837833804 |
10 | 2664266220040 |
11 | 9379aa907727 |
12 | 370429449234 |
13 | 1643157718c9 |
14 | 92d4603a02c |
15 | 49484dad52a |
hex | 26c52a44208 |
2664266220040 has 32 divisors (see below), whose sum is σ = 6122143658880. Its totient is φ = 1043031881152.
The previous prime is 2664266219999. The next prime is 2664266220047. The reversal of 2664266220040 is 400226624662.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 2664266219975 and 2664266220002.
It is not an unprimeable number, because it can be changed into a prime (2664266220047) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 708579562 + ... + 708583321.
It is an arithmetic number, because the mean of its divisors is an integer number (191316989340).
Almost surely, 22664266220040 is an apocalyptic number.
2664266220040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2664266220040 is an abundant number, since it is smaller than the sum of its proper divisors (3457877438840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2664266220040 is a wasteful number, since it uses less digits than its factorization.
2664266220040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1417162941 (or 1417162937 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 40.
The spelling of 2664266220040 in words is "two trillion, six hundred sixty-four billion, two hundred sixty-six million, two hundred twenty thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •