Base | Representation |
---|---|
bin | 11111100000000010010001… |
… | …01100011010010010011010 |
3 | 100002021012010220122010212120 |
4 | 33300001020230122102122 |
5 | 33034411341222321300 |
6 | 403154223441122110 |
7 | 20406424244160324 |
oct | 1760011054322232 |
9 | 302235126563776 |
10 | 69270452151450 |
11 | 200874853a9590 |
12 | 79290b2329336 |
13 | 2c86238a75a14 |
14 | 13169ca1b4614 |
15 | 801d3b87a3a0 |
hex | 3f0048b1a49a |
69270452151450 has 48 divisors (see below), whose sum is σ = 187408059643296. Its totient is φ = 16792836884800.
The previous prime is 69270452151403. The next prime is 69270452151473. The reversal of 69270452151450 is 5415125407296.
It is a junction number, because it is equal to n+sod(n) for n = 69270452151393 and 69270452151402.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 20991044457 + ... + 20991047756.
It is an arithmetic number, because the mean of its divisors is an integer number (3904334575902).
Almost surely, 269270452151450 is an apocalyptic number.
69270452151450 is an abundant number, since it is smaller than the sum of its proper divisors (118137607491846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69270452151450 is a wasteful number, since it uses less digits than its factorization.
69270452151450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41982092239 (or 41982092234 counting only the distinct ones).
The product of its (nonzero) digits is 3024000, while the sum is 51.
The spelling of 69270452151450 in words is "sixty-nine trillion, two hundred seventy billion, four hundred fifty-two million, one hundred fifty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •