Base | Representation |
---|---|
bin | 1001001001101010100110… |
… | …11110001011001111001001 |
3 | 2122020202210220221102012220 |
4 | 10210311103132023033021 |
5 | 10114200030440413113 |
6 | 110444305424524253 |
7 | 4144601453313402 |
oct | 444652336131711 |
9 | 78222726842186 |
10 | 20123322201033 |
11 | 645928684aa47 |
12 | 231004ba80689 |
13 | b2c80c85461c |
14 | 4d7d8c8bc9a9 |
15 | 24d6c1827523 |
hex | 124d5378b3c9 |
20123322201033 has 32 divisors (see below), whose sum is σ = 28335484800000. Its totient is φ = 12667999056192.
The previous prime is 20123322201023. The next prime is 20123322201049. The reversal of 20123322201033 is 33010222332102.
It is not a de Polignac number, because 20123322201033 - 224 = 20123305423817 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20123322200994 and 20123322201012.
It is not an unprimeable number, because it can be changed into a prime (20123322201013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42717583 + ... + 43186091.
It is an arithmetic number, because the mean of its divisors is an integer number (885483900000).
Almost surely, 220123322201033 is an apocalyptic number.
It is an amenable number.
20123322201033 is a deficient number, since it is larger than the sum of its proper divisors (8212162598967).
20123322201033 is a wasteful number, since it uses less digits than its factorization.
20123322201033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470989.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 20123322201033 its reverse (33010222332102), we get a palindrome (53133544533135).
The spelling of 20123322201033 in words is "twenty trillion, one hundred twenty-three billion, three hundred twenty-two million, two hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •