Base | Representation |
---|---|
bin | 100000010011100110… |
… | …1001110000100001000 |
3 | 20122002000112122110121 |
4 | 1000213031032010020 |
5 | 2114041034104030 |
6 | 51512123153024 |
7 | 5004142632412 |
oct | 1004715160410 |
9 | 218060478417 |
10 | 69377253640 |
11 | 27471718562 |
12 | 11542375774 |
13 | 6708416596 |
14 | 350202b9b2 |
15 | 1c10aed47a |
hex | 102734e108 |
69377253640 has 64 divisors (see below), whose sum is σ = 165535274160. Its totient is φ = 26078330880.
The previous prime is 69377253587. The next prime is 69377253653. The reversal of 69377253640 is 4635277396.
It can be written as a sum of positive squares in 8 ways, for example, as 7295551396 + 62081702244 = 85414^2 + 249162^2 .
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 365920 + ... + 522160.
Almost surely, 269377253640 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 69377253640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82767637080).
69377253640 is an abundant number, since it is smaller than the sum of its proper divisors (96158020520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
69377253640 is a wasteful number, since it uses less digits than its factorization.
69377253640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 156922 (or 156918 counting only the distinct ones).
The product of its (nonzero) digits is 5715360, while the sum is 52.
The spelling of 69377253640 in words is "sixty-nine billion, three hundred seventy-seven million, two hundred fifty-three thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •