Base | Representation |
---|---|
bin | 1010111100010111000100… |
… | …0011000101011101110010 |
3 | 1120121020221201221121012101 |
4 | 2233011301003011131302 |
5 | 3034113220101432242 |
6 | 41331245341051014 |
7 | 2351201440532521 |
oct | 257056103053562 |
9 | 46536851847171 |
10 | 12032100030322 |
11 | 391986a877789 |
12 | 1423a99b56a6a |
13 | 693811b83578 |
14 | 2d84dccc04b8 |
15 | 15ceb10ba9b7 |
hex | af1710c5772 |
12032100030322 has 8 divisors (see below), whose sum is σ = 18048172107996. Its totient is φ = 6016042660992.
The previous prime is 12032100030319. The next prime is 12032100030361. The reversal of 12032100030322 is 22303000123021.
12032100030322 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 9552605751441 + 2479494278881 = 3090729^2 + 1574641^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×120321000303222 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12032100030322.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1333143 + ... + 5083450.
Almost surely, 212032100030322 is an apocalyptic number.
12032100030322 is a deficient number, since it is larger than the sum of its proper divisors (6016072077674).
12032100030322 is an equidigital number, since it uses as much as digits as its factorization.
12032100030322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7354172.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 12032100030322 its reverse (22303000123021), we get a palindrome (34335100153343).
The spelling of 12032100030322 in words is "twelve trillion, thirty-two billion, one hundred million, thirty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •