Base | Representation |
---|---|
bin | 100111011110110111010… |
… | …011001000011010001000 |
3 | 100121101020112201212220012 |
4 | 213132313103020122020 |
5 | 323423113100000410 |
6 | 5434232055451052 |
7 | 400010421106043 |
oct | 47366723103210 |
9 | 10541215655805 |
10 | 2713199609480 |
11 | 9567304a0448 |
12 | 379a05086a88 |
13 | 168b13551609 |
14 | 95468c3dc5a |
15 | 4a89acb5605 |
hex | 277b74c8688 |
2713199609480 has 16 divisors (see below), whose sum is σ = 6104699121420. Its totient is φ = 1085279843776.
The previous prime is 2713199609479. The next prime is 2713199609507. The reversal of 2713199609480 is 849069913172.
2713199609480 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 2712918644836 + 280964644 = 1647094^2 + 16762^2 .
It is a super-2 number, since 2×27131996094802 (a number of 26 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33914995079 + ... + 33914995158.
Almost surely, 22713199609480 is an apocalyptic number.
2713199609480 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2713199609480 is an abundant number, since it is smaller than the sum of its proper divisors (3391499511940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2713199609480 is a wasteful number, since it uses less digits than its factorization.
2713199609480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67829990248 (or 67829990244 counting only the distinct ones).
The product of its (nonzero) digits is 5878656, while the sum is 59.
The spelling of 2713199609480 in words is "two trillion, seven hundred thirteen billion, one hundred ninety-nine million, six hundred nine thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •