Base | Representation |
---|---|
bin | 1011101111000001001… |
… | …10110100001010000111 |
3 | 1102112201201100220021201 |
4 | 11313200212310022013 |
5 | 23101223224330043 |
6 | 505121100123331 |
7 | 41062451256463 |
oct | 5674046641207 |
9 | 1375651326251 |
10 | 403200230023 |
11 | 145aa60225a8 |
12 | 66186b36547 |
13 | 2c03865a786 |
14 | 1572d20b4a3 |
15 | a74c83ec4d |
hex | 5de09b4287 |
403200230023 has 8 divisors (see below), whose sum is σ = 416295904896. Its totient is φ = 390110131200.
The previous prime is 403200230021. The next prime is 403200230063. The reversal of 403200230023 is 320032002304.
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 403200230023 - 21 = 403200230021 is a prime.
It is a super-2 number, since 2×4032002300232 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (403200230021) 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 7 ways as a sum of consecutive naturals, for example, 1246798 + ... + 1536523.
It is an arithmetic number, because the mean of its divisors is an integer number (52036988112).
Almost surely, 2403200230023 is an apocalyptic number.
403200230023 is a deficient number, since it is larger than the sum of its proper divisors (13095674873).
403200230023 is a wasteful number, since it uses less digits than its factorization.
403200230023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2788025.
The product of its (nonzero) digits is 864, while the sum is 19.
Adding to 403200230023 its reverse (320032002304), we get a palindrome (723232232327).
The spelling of 403200230023 in words is "four hundred three billion, two hundred million, two hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •