Base | Representation |
---|---|
bin | 100111110010011101111… |
… | …100100011110111000101 |
3 | 100200101120112001201200210 |
4 | 213302131330203313011 |
5 | 324244220232124233 |
6 | 5452032515230033 |
7 | 401354145603210 |
oct | 47623574436705 |
9 | 10611515051623 |
10 | 2734249098693 |
11 | 964652375222 |
12 | 381aba5a8319 |
13 | 16aab94a3188 |
14 | 964a4676777 |
15 | 4b1cdc3b163 |
hex | 27c9df23dc5 |
2734249098693 has 32 divisors (see below), whose sum is σ = 4279321790464. Its totient is φ = 1520115170112.
The previous prime is 2734249098689. The next prime is 2734249098697. The reversal of 2734249098693 is 3968909424372.
It is an interprime number because it is at equal distance from previous prime (2734249098689) and next prime (2734249098697).
It is not a de Polignac number, because 2734249098693 - 22 = 2734249098689 is a prime.
It is a super-2 number, since 2×27342490986932 (a number of 26 digits) contains 22 as substring.
It is the 1653557-th Hogben number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2734249098697) by changing a digit.
It is a nontrivial repunit in base 1653556.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15348096 + ... + 15525222.
It is an arithmetic number, because the mean of its divisors is an integer number (133728805952).
Almost surely, 22734249098693 is an apocalyptic number.
It is an amenable number.
2734249098693 is a deficient number, since it is larger than the sum of its proper divisors (1545072691771).
2734249098693 is a wasteful number, since it uses less digits than its factorization.
2734249098693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197041.
The product of its (nonzero) digits is 141087744, while the sum is 66.
The spelling of 2734249098693 in words is "two trillion, seven hundred thirty-four billion, two hundred forty-nine million, ninety-eight thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •