Base | Representation |
---|---|
bin | 11111001010000011100… |
… | …111111110111111010000 |
3 | 21120200120002011122200022 |
4 | 133022003213332333100 |
5 | 240034434103312240 |
6 | 4315335250443012 |
7 | 310455334542320 |
oct | 37120347767720 |
9 | 7520502148608 |
10 | 2141102010320 |
11 | 7560442a2659 |
12 | 2a6b62893468 |
13 | 126b9c52c080 |
14 | 758b65c1280 |
15 | 3aa658309b5 |
hex | 1f2839fefd0 |
2141102010320 has 80 divisors (see below), whose sum is σ = 6126845773440. Its totient is φ = 677623491072.
The previous prime is 2141102010277. The next prime is 2141102010323. The reversal of 2141102010320 is 230102011412.
It is a tau number, because it is divible by the number of its divisors (80).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2141102010323) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 147046430 + ... + 147060989.
It is an arithmetic number, because the mean of its divisors is an integer number (76585572168).
Almost surely, 22141102010320 is an apocalyptic number.
2141102010320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2141102010320 is an abundant number, since it is smaller than the sum of its proper divisors (3985743763120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2141102010320 is a wasteful number, since it uses less digits than its factorization.
2141102010320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 294107452 (or 294107446 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 2141102010320 its reverse (230102011412), we get a palindrome (2371204021732).
The spelling of 2141102010320 in words is "two trillion, one hundred forty-one billion, one hundred two million, ten thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •