Base | Representation |
---|---|
bin | 111101110110010100110001… |
… | …011000010010011001110111 |
3 | 1022200010021122210220111021200 |
4 | 331312110301120102121313 |
5 | 241123134124001123431 |
6 | 2402305300343343543 |
7 | 111203235206302125 |
oct | 7566246130223167 |
9 | 1280107583814250 |
10 | 272013992207991 |
11 | 79743539236210 |
12 | 26612173751bb3 |
13 | b8a1a6a33b257 |
14 | 4b25794384915 |
15 | 216aa95156ee6 |
hex | f76531612677 |
272013992207991 has 24 divisors (see below), whose sum is σ = 428828122384896. Its totient is φ = 164780036724240.
The previous prime is 272013992207963. The next prime is 272013992208121. The reversal of 272013992207991 is 199702299310272.
272013992207991 is a `hidden beast` number, since 2 + 72 + 0 + 1 + 399 + 2 + 20 + 79 + 91 = 666.
It is not a de Polignac number, because 272013992207991 - 217 = 272013992076919 is a prime.
It is a super-2 number, since 2×2720139922079912 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (272013992207941) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 640855525 + ... + 641279838.
It is an arithmetic number, because the mean of its divisors is an integer number (17867838432704).
Almost surely, 2272013992207991 is an apocalyptic number.
272013992207991 is a deficient number, since it is larger than the sum of its proper divisors (156814130176905).
272013992207991 is a wasteful number, since it uses less digits than its factorization.
272013992207991 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1282137523 (or 1282137520 counting only the distinct ones).
The product of its (nonzero) digits is 15431472, while the sum is 63.
The spelling of 272013992207991 in words is "two hundred seventy-two trillion, thirteen billion, nine hundred ninety-two million, two hundred seven thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •