Base | Representation |
---|---|
bin | 1001001111101100001100… |
… | …00111110101101111000111 |
3 | 2122222120010200102012121101 |
4 | 10213312012013311233013 |
5 | 10131043004041222043 |
6 | 111123342545200531 |
7 | 4165550353144300 |
oct | 447660607655707 |
9 | 78876120365541 |
10 | 20330330414023 |
11 | 6529054565303 |
12 | 23441a2630147 |
13 | b461aca93a96 |
14 | 503dc96577a7 |
15 | 253c8a18924d |
hex | 127d861f5bc7 |
20330330414023 has 6 divisors (see below), whose sum is σ = 23649568032696. Its totient is φ = 17425997497692.
The previous prime is 20330330413961. The next prime is 20330330414027. The reversal of 20330330414023 is 32041403303302.
It is a happy number.
It is not a de Polignac number, because 20330330414023 - 221 = 20330328316871 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20330330413982 and 20330330414000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20330330414027) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 207452351115 + ... + 207452351212.
It is an arithmetic number, because the mean of its divisors is an integer number (3941594672116).
Almost surely, 220330330414023 is an apocalyptic number.
20330330414023 is a deficient number, since it is larger than the sum of its proper divisors (3319237618673).
20330330414023 is an equidigital number, since it uses as much as digits as its factorization.
20330330414023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 414904702341 (or 414904702334 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 28.
Adding to 20330330414023 its reverse (32041403303302), we get a palindrome (52371733717325).
The spelling of 20330330414023 in words is "twenty trillion, three hundred thirty billion, three hundred thirty million, four hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •