Base | Representation |
---|---|
bin | 111010100000000010100… |
… | …011110110110110110110 |
3 | 112020022122221020200221201 |
4 | 322200002203312312312 |
5 | 1011331212334440342 |
6 | 12314453500003114 |
7 | 563305425050242 |
oct | 72400243666666 |
9 | 15208587220851 |
10 | 4020132343222 |
11 | 130aa239a3056 |
12 | 54b16623049a |
13 | 232134a2c568 |
14 | dc80b035422 |
15 | 6e88d668db7 |
hex | 3a8028f6db6 |
4020132343222 has 4 divisors (see below), whose sum is σ = 6030198514836. Its totient is φ = 2010066171610.
The previous prime is 4020132343189. The next prime is 4020132343223. The reversal of 4020132343222 is 2223432310204.
4020132343222 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a super-3 number, since 3×40201323432223 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4020132343223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005033085804 + ... + 1005033085807.
It is an arithmetic number, because the mean of its divisors is an integer number (1507549628709).
Almost surely, 24020132343222 is an apocalyptic number.
4020132343222 is a deficient number, since it is larger than the sum of its proper divisors (2010066171614).
4020132343222 is a wasteful number, since it uses less digits than its factorization.
4020132343222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2010066171613.
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 4020132343222 its reverse (2223432310204), we get a palindrome (6243564653426).
The spelling of 4020132343222 in words is "four trillion, twenty billion, one hundred thirty-two million, three hundred forty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •