Base | Representation |
---|---|
bin | 1011000001001101001000… |
… | …0000111011101010001011 |
3 | 1120220012210021010211222001 |
4 | 2300103102000323222023 |
5 | 3041444144244000233 |
6 | 41433412322411431 |
7 | 2360206126226353 |
oct | 260232200735213 |
9 | 46805707124861 |
10 | 12115331234443 |
11 | 39510a06aa298 |
12 | 1438047b00b77 |
13 | 69b617560c88 |
14 | 2dc556c47b63 |
15 | 16023309d27d |
hex | b04d203ba8b |
12115331234443 has 8 divisors (see below), whose sum is σ = 12538360728000. Its totient is φ = 11692652371008.
The previous prime is 12115331234437. The next prime is 12115331234509. The reversal of 12115331234443 is 34443213351121.
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 12115331234443 - 241 = 9916307978891 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12115331234243) 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, 87587218 + ... + 87725431.
It is an arithmetic number, because the mean of its divisors is an integer number (1567295091000).
Almost surely, 212115331234443 is an apocalyptic number.
12115331234443 is a deficient number, since it is larger than the sum of its proper divisors (423029493557).
12115331234443 is a wasteful number, since it uses less digits than its factorization.
12115331234443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175315061.
The product of its digits is 103680, while the sum is 37.
Adding to 12115331234443 its reverse (34443213351121), we get a palindrome (46558544585564).
The spelling of 12115331234443 in words is "twelve trillion, one hundred fifteen billion, three hundred thirty-one million, two hundred thirty-four thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •