Base | Representation |
---|---|
bin | 11111011011111100110100… |
… | …10110100111100101000000 |
3 | 100001202202211201012010201110 |
4 | 33231332122112213211000 |
5 | 33030111410042442124 |
6 | 403005531335403320 |
7 | 20363325013534011 |
oct | 1755763226474500 |
9 | 301682751163643 |
10 | 69130088249664 |
11 | 200329a6665672 |
12 | 7905a5a823540 |
13 | 2c75c299a1030 |
14 | 130dcb24db008 |
15 | 7ed373c26029 |
hex | 3edf9a5a7940 |
69130088249664 has 224 divisors, whose sum is σ = 211500806904576. Its totient is φ = 19737606389760.
The previous prime is 69130088249641. The next prime is 69130088249693. The reversal of 69130088249664 is 46694288003196.
It is a super-2 number, since 2×691300882496642 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 69130088249595 and 69130088249604.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8460547 + ... + 14485890.
It is an arithmetic number, because the mean of its divisors is an integer number (944200030824).
Almost surely, 269130088249664 is an apocalyptic number.
69130088249664 is a gapful number since it is divisible by the number (64) formed by its first and last digit.
It is an amenable number.
69130088249664 is an abundant number, since it is smaller than the sum of its proper divisors (142370718654912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69130088249664 is a wasteful number, since it uses less digits than its factorization.
69130088249664 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22946553 (or 22946543 counting only the distinct ones).
The product of its (nonzero) digits is 107495424, while the sum is 66.
The spelling of 69130088249664 in words is "sixty-nine trillion, one hundred thirty billion, eighty-eight million, two hundred forty-nine thousand, six hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •