Base | Representation |
---|---|
bin | 1001001111101011100110… |
… | …01001010011010001000110 |
3 | 2122222112022111022121212100 |
4 | 10213311303021103101012 |
5 | 10131041331034430042 |
6 | 111123251213132530 |
7 | 4165536436006122 |
oct | 447656311232106 |
9 | 78875274277770 |
10 | 20330012030022 |
11 | 6528a00874732 |
12 | 2344113a8a146 |
13 | b4615bb2a296 |
14 | 503d9925a582 |
15 | 253c6c24824c |
hex | 127d73253446 |
20330012030022 has 48 divisors (see below), whose sum is σ = 44485453995840. Its totient is φ = 6709428288000.
The previous prime is 20330012030017. The next prime is 20330012030033. The reversal of 20330012030022 is 22003021003302.
It is a happy number.
20330012030022 is a `hidden beast` number, since 2 + 0 + 330 + 0 + 12 + 0 + 300 + 22 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 20330012029977 and 20330012030004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 110735379 + ... + 110918817.
It is an arithmetic number, because the mean of its divisors is an integer number (926780291580).
Almost surely, 220330012030022 is an apocalyptic number.
20330012030022 is an abundant number, since it is smaller than the sum of its proper divisors (24155441965818).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20330012030022 is a wasteful number, since it uses less digits than its factorization.
20330012030022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 244509 (or 244506 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 20330012030022 its reverse (22003021003302), we get a palindrome (42333033033324).
The spelling of 20330012030022 in words is "twenty trillion, three hundred thirty billion, twelve million, thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •