Base | Representation |
---|---|
bin | 10001101000111100110… |
… | …00100010111111111111 |
3 | 2010221110011100021110111 |
4 | 20310132120202333333 |
5 | 34412243113440111 |
6 | 1142234421250451 |
7 | 61534504120561 |
oct | 10643630427777 |
9 | 2127404307414 |
10 | 606100140031 |
11 | 214055801041 |
12 | 99571863a27 |
13 | 452026b8719 |
14 | 2149a4bd331 |
15 | 10b75686a21 |
hex | 8d1e622fff |
606100140031 has 8 divisors (see below), whose sum is σ = 608530210400. Its totient is φ = 603674032608.
The previous prime is 606100140013. The next prime is 606100140077. The reversal of 606100140031 is 130041001606.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 606100140031 - 229 = 605563269119 is a prime.
It is a super-2 number, since 2×6061001400312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 606100139984 and 606100140011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (606100140001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 684051 + ... + 1296196.
It is an arithmetic number, because the mean of its divisors is an integer number (76066276300).
Almost surely, 2606100140031 is an apocalyptic number.
606100140031 is a deficient number, since it is larger than the sum of its proper divisors (2430070369).
606100140031 is a wasteful number, since it uses less digits than its factorization.
606100140031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1981473.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 606100140031 its reverse (130041001606), we get a palindrome (736141141637).
The spelling of 606100140031 in words is "six hundred six billion, one hundred million, one hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •