Base | Representation |
---|---|
bin | 111010100001110010100… |
… | …010111010100010001100 |
3 | 112020111111212112200120000 |
4 | 322201302202322202030 |
5 | 1011344034323104312 |
6 | 12315404133124300 |
7 | 563403120435426 |
oct | 72416242724214 |
9 | 15214455480500 |
10 | 4022011144332 |
11 | 13107a848a145 |
12 | 54b5ab489690 |
13 | 2323740500ac |
14 | dc948781816 |
15 | 6e94d58aadc |
hex | 3a8728ba88c |
4022011144332 has 30 divisors (see below), whose sum is σ = 10514331603468. Its totient is φ = 1340670381336.
The previous prime is 4022011144271. The next prime is 4022011144397. The reversal of 4022011144332 is 2334411102204.
4022011144332 is a `hidden beast` number, since 4 + 0 + 2 + 201 + 11 + 443 + 3 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 4022011144296 and 4022011144305.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 6206806998 + ... + 6206807645.
Almost surely, 24022011144332 is an apocalyptic number.
It is an amenable number.
4022011144332 is an abundant number, since it is smaller than the sum of its proper divisors (6492320459136).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4022011144332 is a wasteful number, since it uses less digits than its factorization.
4022011144332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12413614659 (or 12413614648 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 4022011144332 its reverse (2334411102204), we get a palindrome (6356422246536).
The spelling of 4022011144332 in words is "four trillion, twenty-two billion, eleven million, one hundred forty-four thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •