Base | Representation |
---|---|
bin | 1010111011110010001100… |
… | …0001011011110011000000 |
3 | 1120120022101212020210101120 |
4 | 2232330203001123303000 |
5 | 3033432431431240224 |
6 | 41322531203232240 |
7 | 2350401230516565 |
oct | 256744301336300 |
9 | 46508355223346 |
10 | 12022201040064 |
11 | 39156500838a6 |
12 | 1421b96978680 |
13 | 6928c50a1397 |
14 | 2d7c4033286c |
15 | 15cad2011779 |
hex | aef2305bcc0 |
12022201040064 has 112 divisors (see below), whose sum is σ = 32415168847968. Its totient is φ = 3931029127168.
The previous prime is 12022201040063. The next prime is 12022201040099. The reversal of 12022201040064 is 46004010222021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (12022201040063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53790754 + ... + 54013790.
Almost surely, 212022201040064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12022201040064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16207584423984).
12022201040064 is an abundant number, since it is smaller than the sum of its proper divisors (20392967807904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022201040064 is a wasteful number, since it uses less digits than its factorization.
12022201040064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228402 (or 228392 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 12022201040064 its reverse (46004010222021), we get a palindrome (58026211262085).
The spelling of 12022201040064 in words is "twelve trillion, twenty-two billion, two hundred one million, forty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •