Base | Representation |
---|---|
bin | 1001100000111000111011011… |
… | …0001000100100101011111011 |
3 | 10020210102202200202120021100102 |
4 | 2120032032312020210223323 |
5 | 1200222234224214332411 |
6 | 10331511210315030015 |
7 | 261005261225012312 |
oct | 23016166610445373 |
9 | 3223382622507312 |
10 | 669481082964731 |
11 | 184354372aa8024 |
12 | 63105b0413b30b |
13 | 22973a45185a6b |
14 | bb470b3371279 |
15 | 525eb15432d3b |
hex | 260e3b6224afb |
669481082964731 has 2 divisors, whose sum is σ = 669481082964732. Its totient is φ = 669481082964730.
The previous prime is 669481082964709. The next prime is 669481082964767. The reversal of 669481082964731 is 137469280184966.
669481082964731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 669481082964731 - 214 = 669481082948347 is a prime.
It is a super-2 number, since 2×6694810829647312 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (669481082964781) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 334740541482365 + 334740541482366.
It is an arithmetic number, because the mean of its divisors is an integer number (334740541482366).
Almost surely, 2669481082964731 is an apocalyptic number.
669481082964731 is a deficient number, since it is larger than the sum of its proper divisors (1).
669481082964731 is an equidigital number, since it uses as much as digits as its factorization.
669481082964731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 752467968, while the sum is 74.
The spelling of 669481082964731 in words is "six hundred sixty-nine trillion, four hundred eighty-one billion, eighty-two million, nine hundred sixty-four thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •