Base | Representation |
---|---|
bin | 100111010011010110000… |
… | …110001110000101111100 |
3 | 100120012022120210121000010 |
4 | 213103112012032011330 |
5 | 323222300320313300 |
6 | 5424424514303220 |
7 | 366062056154004 |
oct | 47232606160574 |
9 | 10505276717003 |
10 | 2700831416700 |
11 | 951463a1911a |
12 | 377532b87b10 |
13 | 1678c2033c51 |
14 | 94a1437b004 |
15 | 4a3c5065a50 |
hex | 274d618e17c |
2700831416700 has 72 divisors (see below), whose sum is σ = 8154162350208. Its totient is φ = 688907721920.
The previous prime is 2700831416609. The next prime is 2700831416729. The reversal of 2700831416700 is 76141380072.
2700831416700 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 195705522 + ... + 195719321.
It is an arithmetic number, because the mean of its divisors is an integer number (113252254864).
Almost surely, 22700831416700 is an apocalyptic number.
2700831416700 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2700831416700 is an abundant number, since it is smaller than the sum of its proper divisors (5453330933508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2700831416700 is a wasteful number, since it uses less digits than its factorization.
2700831416700 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391424883 (or 391424876 counting only the distinct ones).
The product of its (nonzero) digits is 56448, while the sum is 39.
Adding to 2700831416700 its reverse (76141380072), we get a palindrome (2776972796772).
The spelling of 2700831416700 in words is "two trillion, seven hundred billion, eight hundred thirty-one million, four hundred sixteen thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •