Base | Representation |
---|---|
bin | 100101100011010000… |
… | …111110111010000111 |
3 | 10212001222101101220222 |
4 | 211203100332322013 |
5 | 1130033421231043 |
6 | 30304531414555 |
7 | 2625112132565 |
oct | 454320767207 |
9 | 125058341828 |
10 | 40320102023 |
11 | 16110712473 |
12 | 799315445b |
13 | 3a5749b046 |
14 | 1d46cd4a35 |
15 | 10aeb66d68 |
hex | 96343ee87 |
40320102023 has 4 divisors (see below), whose sum is σ = 40320546720. Its totient is φ = 40319657328.
The previous prime is 40320102001. The next prime is 40320102059. The reversal of 40320102023 is 32020102304.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 40320102023 - 216 = 40320036487 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40320101992 and 40320102010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40320102523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32063 + ... + 285776.
It is an arithmetic number, because the mean of its divisors is an integer number (10080136680).
Almost surely, 240320102023 is an apocalyptic number.
40320102023 is a deficient number, since it is larger than the sum of its proper divisors (444697).
40320102023 is a wasteful number, since it uses less digits than its factorization.
40320102023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444696.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 40320102023 its reverse (32020102304), we get a palindrome (72340204327).
The spelling of 40320102023 in words is "forty billion, three hundred twenty million, one hundred two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •