Base | Representation |
---|---|
bin | 100000001100011110… |
… | …0011011000101001001 |
3 | 20121110100021202022100 |
4 | 1000120330123011021 |
5 | 2113043310010411 |
6 | 51432254344013 |
7 | 4665206021100 |
oct | 1003074330511 |
9 | 217410252270 |
10 | 69137969481 |
11 | 27359643859 |
12 | 114961bb009 |
13 | 669a986519 |
14 | 34bc341037 |
15 | 1be9ad4456 |
hex | 1018f1b149 |
69137969481 has 81 divisors (see below), whose sum is σ = 122792978061. Its totient is φ = 37371278448.
The previous prime is 69137969447. The next prime is 69137969491. The reversal of 69137969481 is 18496973196.
The square root of 69137969481 is 262941.
It is a perfect power (a square), and thus also a powerful number.
69137969481 is a `hidden beast` number, since 6 + 91 + 3 + 7 + 9 + 69 + 481 = 666.
It is not a de Polignac number, because 69137969481 - 213 = 69137961289 is a prime.
It is a super-2 number, since 2×691379694812 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (69137969491) by changing a digit.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 104913130 + ... + 104913788.
Almost surely, 269137969481 is an apocalyptic number.
69137969481 is the 262941-st square number.
69137969481 is the 131471-st centered octagonal number.
It is an amenable number.
69137969481 is a deficient number, since it is larger than the sum of its proper divisors (53655008580).
69137969481 is an equidigital number, since it uses as much as digits as its factorization.
69137969481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1376 (or 688 counting only the distinct ones).
The product of its digits is 17635968, while the sum is 63.
The spelling of 69137969481 in words is "sixty-nine billion, one hundred thirty-seven million, nine hundred sixty-nine thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •