Base | Representation |
---|---|
bin | 1010111100011000010000… |
… | …1000000110001111000111 |
3 | 1120121021210001020101202112 |
4 | 2233012010020012033013 |
5 | 3034114344022030203 |
6 | 41331341213331235 |
7 | 2351212405266314 |
oct | 257060410061707 |
9 | 46537701211675 |
10 | 12032420111303 |
11 | 3919a14517319 |
12 | 1423b69196b1b |
13 | 6938632925b7 |
14 | 2d852d5ddd0b |
15 | 15cece2446d8 |
hex | af1842063c7 |
12032420111303 has 8 divisors (see below), whose sum is σ = 12202217675136. Its totient is φ = 11862631627000.
The previous prime is 12032420111281. The next prime is 12032420111351. The reversal of 12032420111303 is 30311102423021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12032420111303 - 230 = 12031346369479 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12032420111363) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 421628 + ... + 4923678.
It is an arithmetic number, because the mean of its divisors is an integer number (1525277209392).
Almost surely, 212032420111303 is an apocalyptic number.
12032420111303 is a deficient number, since it is larger than the sum of its proper divisors (169797563833).
12032420111303 is an equidigital number, since it uses as much as digits as its factorization.
12032420111303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4539765.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 12032420111303 its reverse (30311102423021), we get a palindrome (42343522534324).
The spelling of 12032420111303 in words is "twelve trillion, thirty-two billion, four hundred twenty million, one hundred eleven thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •