Base | Representation |
---|---|
bin | 1001001100100100010101… |
… | …01001010000010011000001 |
3 | 2122121022011212201002201010 |
4 | 10212102022221100103001 |
5 | 10122313232204200113 |
6 | 111002155510031133 |
7 | 4155031405421400 |
oct | 446221251202301 |
9 | 78538155632633 |
10 | 20223032100033 |
11 | 64975a3452954 |
12 | 23274386484a9 |
13 | b39040220b69 |
14 | 4dcb2b1c5637 |
15 | 2510aa35b1c3 |
hex | 12648aa504c1 |
20223032100033 has 96 divisors (see below), whose sum is σ = 31858702977024. Its totient is φ = 11376120258048.
The previous prime is 20223032099987. The next prime is 20223032100043. The reversal of 20223032100033 is 33000123032202.
It is not a de Polignac number, because 20223032100033 - 210 = 20223032099009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 20223032099982 and 20223032100009.
It is not an unprimeable number, because it can be changed into a prime (20223032100043) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 5123644366 + ... + 5123648312.
It is an arithmetic number, because the mean of its divisors is an integer number (331861489344).
Almost surely, 220223032100033 is an apocalyptic number.
It is an amenable number.
20223032100033 is a deficient number, since it is larger than the sum of its proper divisors (11635670876991).
20223032100033 is a wasteful number, since it uses less digits than its factorization.
20223032100033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6091 (or 6084 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 20223032100033 its reverse (33000123032202), we get a palindrome (53223155132235).
The spelling of 20223032100033 in words is "twenty trillion, two hundred twenty-three billion, thirty-two million, one hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •