Base | Representation |
---|---|
bin | 11110100100111101001… |
… | …010011010001100010100 |
3 | 21102212201210002022010220 |
4 | 132210331022122030110 |
5 | 233411342334143034 |
6 | 4245150300314340 |
7 | 304545211022526 |
oct | 36447512321424 |
9 | 7385653068126 |
10 | 2101265146644 |
11 | 740161439324 |
12 | 29b2a55429b0 |
13 | 1231c11c79a1 |
14 | 739b795ba16 |
15 | 399d3320749 |
hex | 1e93d29a314 |
2101265146644 has 24 divisors (see below), whose sum is σ = 4904779498080. Its totient is φ = 700160645664.
The previous prime is 2101265146639. The next prime is 2101265146649. The reversal of 2101265146644 is 4466415621012.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2101265146639) and next prime (2101265146649).
It is a junction number, because it is equal to n+sod(n) for n = 2101265146596 and 2101265146605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101265146649) 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, 32600199 + ... + 32664590.
It is an arithmetic number, because the mean of its divisors is an integer number (204365812420).
Almost surely, 22101265146644 is an apocalyptic number.
It is an amenable number.
2101265146644 is an abundant number, since it is smaller than the sum of its proper divisors (2803514351436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101265146644 is a wasteful number, since it uses less digits than its factorization.
2101265146644 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65267479 (or 65267477 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 42.
The spelling of 2101265146644 in words is "two trillion, one hundred one billion, two hundred sixty-five million, one hundred forty-six thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •