Base | Representation |
---|---|
bin | 1100001111011110001… |
… | …01011010001010100111 |
3 | 1111012200221101022220012 |
4 | 12013233011122022213 |
5 | 23342413442001411 |
6 | 521122002400435 |
7 | 42250300340060 |
oct | 6075705321247 |
9 | 1435627338805 |
10 | 420623000231 |
11 | 152426799745 |
12 | 6962996011b |
13 | 30884105765 |
14 | 165030db567 |
15 | ae1c1c718b |
hex | 61ef15a2a7 |
420623000231 has 4 divisors (see below), whose sum is σ = 480712000272. Its totient is φ = 360534000192.
The previous prime is 420623000221. The next prime is 420623000257. The reversal of 420623000231 is 132000326024.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 420623000231 - 210 = 420622999207 is a prime.
It is a super-2 number, since 2×4206230002312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 420623000197 and 420623000206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (420623000221) 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, 30044500010 + ... + 30044500023.
It is an arithmetic number, because the mean of its divisors is an integer number (120178000068).
Almost surely, 2420623000231 is an apocalyptic number.
420623000231 is a deficient number, since it is larger than the sum of its proper divisors (60089000041).
420623000231 is an equidigital number, since it uses as much as digits as its factorization.
420623000231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60089000040.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 420623000231 its reverse (132000326024), we get a palindrome (552623326255).
The spelling of 420623000231 in words is "four hundred twenty billion, six hundred twenty-three million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •