Base | Representation |
---|---|
bin | 10100000101011011111… |
… | …00010110110001011001 |
3 | 2102222022011110011211020 |
4 | 22002231330112301121 |
5 | 42301322420011031 |
6 | 1245011125353053 |
7 | 100600434055353 |
oct | 12025574266131 |
9 | 2388264404736 |
10 | 690113047641 |
11 | 246747907a96 |
12 | b18b9568789 |
13 | 50101011084 |
14 | 2558a1ac0d3 |
15 | 12e410ca096 |
hex | a0adf16c59 |
690113047641 has 4 divisors (see below), whose sum is σ = 920150730192. Its totient is φ = 460075365092.
The previous prime is 690113047621. The next prime is 690113047709. The reversal of 690113047641 is 146740311096.
690113047641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 690113047641 - 223 = 690104659033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 690113047593 and 690113047602.
It is not an unprimeable number, because it can be changed into a prime (690113047621) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 115018841271 + ... + 115018841276.
It is an arithmetic number, because the mean of its divisors is an integer number (230037682548).
Almost surely, 2690113047641 is an apocalyptic number.
It is an amenable number.
690113047641 is a deficient number, since it is larger than the sum of its proper divisors (230037682551).
690113047641 is a wasteful number, since it uses less digits than its factorization.
690113047641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 230037682550.
The product of its (nonzero) digits is 108864, while the sum is 42.
The spelling of 690113047641 in words is "six hundred ninety billion, one hundred thirteen million, forty-seven thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •