Base | Representation |
---|---|
bin | 100111011001010011111… |
… | …001110110001010001011 |
3 | 100120210212000011110122022 |
4 | 213121103321312022023 |
5 | 323323410142210301 |
6 | 5431404301515055 |
7 | 366406600256315 |
oct | 47312371661213 |
9 | 10523760143568 |
10 | 2707237069451 |
11 | 954150825912 |
12 | 378820272a8b |
13 | 1683a3170215 |
14 | 95060dc27b5 |
15 | 4a64c5cbd1b |
hex | 27653e7628b |
2707237069451 has 12 divisors (see below), whose sum is σ = 2730618759960. Its totient is φ = 2684038926240.
The previous prime is 2707237069423. The next prime is 2707237069463. The reversal of 2707237069451 is 1549607327072.
It is not a de Polignac number, because 2707237069451 - 234 = 2690057200267 is a prime.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2707237069393 and 2707237069402.
It is not an unprimeable number, because it can be changed into a prime (2707237569451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10742156 + ... + 10991286.
It is an arithmetic number, because the mean of its divisors is an integer number (227551563330).
Almost surely, 22707237069451 is an apocalyptic number.
2707237069451 is a deficient number, since it is larger than the sum of its proper divisors (23381690509).
2707237069451 is an equidigital number, since it uses as much as digits as its factorization.
2707237069451 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249866 (or 249703 counting only the distinct ones).
The product of its (nonzero) digits is 4445280, while the sum is 53.
The spelling of 2707237069451 in words is "two trillion, seven hundred seven billion, two hundred thirty-seven million, sixty-nine thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •