Base | Representation |
---|---|
bin | 11101100101001011001… |
… | …000010101011010111001 |
3 | 21012022221221012202011000 |
4 | 131211023020111122321 |
5 | 231301113140211342 |
6 | 4153502442155213 |
7 | 266602116652620 |
oct | 35451310253271 |
9 | 7168857182130 |
10 | 2032780007097 |
11 | 714108357344 |
12 | 289b71ab2b09 |
13 | 1198c8876588 |
14 | 7055c1d66b7 |
15 | 37d25be244c |
hex | 1d94b2156b9 |
2032780007097 has 32 divisors (see below), whose sum is σ = 3591384975360. Its totient is φ = 1111084722000.
The previous prime is 2032780007047. The next prime is 2032780007147. The reversal of 2032780007097 is 7907000872302.
It is an interprime number because it is at equal distance from previous prime (2032780007047) and next prime (2032780007147).
It is not a de Polignac number, because 2032780007097 - 218 = 2032779744953 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2032780007047) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 233809779 + ... + 233818472.
It is an arithmetic number, because the mean of its divisors is an integer number (112230780480).
Almost surely, 22032780007097 is an apocalyptic number.
2032780007097 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
It is an amenable number.
2032780007097 is a deficient number, since it is larger than the sum of its proper divisors (1558604968263).
2032780007097 is a wasteful number, since it uses less digits than its factorization.
2032780007097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467628290 (or 467628284 counting only the distinct ones).
The product of its (nonzero) digits is 296352, while the sum is 45.
Adding to 2032780007097 its reverse (7907000872302), we get a palindrome (9939780879399).
The spelling of 2032780007097 in words is "two trillion, thirty-two billion, seven hundred eighty million, seven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •