Base | Representation |
---|---|
bin | 1011111111011010010… |
… | …01101001000001010111 |
3 | 1110101110000212001200121 |
4 | 11333231021221001113 |
5 | 23222234124330011 |
6 | 513134231052411 |
7 | 41523521331115 |
oct | 5775511510127 |
9 | 1411400761617 |
10 | 412000620631 |
11 | 149801678296 |
12 | 67a22211107 |
13 | 2cb0b95c4b2 |
14 | 15d25d02ab5 |
15 | aab523ce71 |
hex | 5fed269057 |
412000620631 has 8 divisors (see below), whose sum is σ = 427116253824. Its totient is φ = 396999068160.
The previous prime is 412000620623. The next prime is 412000620641. The reversal of 412000620631 is 136026000214.
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 412000620631 - 23 = 412000620623 is a prime.
It is a super-2 number, since 2×4120006206312 (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 = 412000620596 and 412000620605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (412000620601) 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, 28512826 + ... + 28527271.
It is an arithmetic number, because the mean of its divisors is an integer number (53389531728).
Almost surely, 2412000620631 is an apocalyptic number.
412000620631 is a deficient number, since it is larger than the sum of its proper divisors (15115633193).
412000620631 is a wasteful number, since it uses less digits than its factorization.
412000620631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57040361.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 412000620631 its reverse (136026000214), we get a palindrome (548026620845).
The spelling of 412000620631 in words is "four hundred twelve billion, six hundred twenty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •