Base | Representation |
---|---|
bin | 101010011010011… |
… | …0010111000001111 |
3 | 10200011212021220112 |
4 | 1110310302320033 |
5 | 10403310013111 |
6 | 353114310235 |
7 | 50160241325 |
oct | 12464627017 |
9 | 3604767815 |
10 | 1423126031 |
11 | 670354718 |
12 | 33872837b |
13 | 198ab7a12 |
14 | d7011d15 |
15 | 84e11e8b |
hex | 54d32e0f |
1423126031 has 8 divisors (see below), whose sum is σ = 1459415664. Its totient is φ = 1386911680.
The previous prime is 1423126027. The next prime is 1423126073. The reversal of 1423126031 is 1306213241.
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 1423126031 - 22 = 1423126027 is a prime.
It is a super-2 number, since 2×14231260312 = 4050575400219625922, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1423125988 and 1423126006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1423126231) 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, 20501 + ... + 57153.
It is an arithmetic number, because the mean of its divisors is an integer number (182426958).
Almost surely, 21423126031 is an apocalyptic number.
1423126031 is a deficient number, since it is larger than the sum of its proper divisors (36289633).
1423126031 is an equidigital number, since it uses as much as digits as its factorization.
1423126031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37641.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 1423126031 is about 37724.3426847970. The cubic root of 1423126031 is about 1124.8150559518.
Adding to 1423126031 its reverse (1306213241), we get a palindrome (2729339272).
The spelling of 1423126031 in words is "one billion, four hundred twenty-three million, one hundred twenty-six thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •