Base | Representation |
---|---|
bin | 1001000111000100111010… |
… | …00011100111111000010001 |
3 | 2121221021012011110101101101 |
4 | 10203202131003213320101 |
5 | 10111220333241104413 |
6 | 110335354204304401 |
7 | 4135302114656200 |
oct | 443423503477021 |
9 | 77837164411341 |
10 | 20034362441233 |
11 | 64245863377a8 |
12 | 22b6963542101 |
13 | b243033bb4ba |
14 | 4d394dc05237 |
15 | 24b216979edd |
hex | 12389d0e7e11 |
20034362441233 has 12 divisors (see below), whose sum is σ = 23315363389632. Its totient is φ = 17164879882920.
The previous prime is 20034362441213. The next prime is 20034362441237. The reversal of 20034362441233 is 33214426343002.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-20034362441233 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20034362441192 and 20034362441201.
It is not an unprimeable number, because it can be changed into a prime (20034362441237) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 88347285 + ... + 88573762.
It is an arithmetic number, because the mean of its divisors is an integer number (1942946949136).
Almost surely, 220034362441233 is an apocalyptic number.
It is an amenable number.
20034362441233 is a deficient number, since it is larger than the sum of its proper divisors (3281000948399).
20034362441233 is a wasteful number, since it uses less digits than its factorization.
20034362441233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176923372 (or 176923365 counting only the distinct ones).
The product of its (nonzero) digits is 248832, while the sum is 37.
Adding to 20034362441233 its reverse (33214426343002), we get a palindrome (53248788784235).
The spelling of 20034362441233 in words is "twenty trillion, thirty-four billion, three hundred sixty-two million, four hundred forty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •