Base | Representation |
---|---|
bin | 1010011000010001111000… |
… | …0010101010011100100111 |
3 | 1111101222222002010010120112 |
4 | 2212010132002222130213 |
5 | 2443434222410320403 |
6 | 40134412420323235 |
7 | 2255335515324143 |
oct | 246043602523447 |
9 | 44358862103515 |
10 | 11412232120103 |
11 | 36aa99a574181 |
12 | 134392554351b |
13 | 64a227019189 |
14 | 2b64d80da223 |
15 | 14bcd1dc49d8 |
hex | a611e0aa727 |
11412232120103 has 8 divisors (see below), whose sum is σ = 11418683148576. Its totient is φ = 11405782765600.
The previous prime is 11412232120063. The next prime is 11412232120111. The reversal of 11412232120103 is 30102123221411.
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 11412232120103 - 212 = 11412232116007 is a prime.
It is a super-2 number, since 2×114122321201032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11412232020103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13347950 + ... + 14177172.
It is an arithmetic number, because the mean of its divisors is an integer number (1427335393572).
Almost surely, 211412232120103 is an apocalyptic number.
11412232120103 is a deficient number, since it is larger than the sum of its proper divisors (6451028473).
11412232120103 is an equidigital number, since it uses as much as digits as its factorization.
11412232120103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 836985.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 11412232120103 its reverse (30102123221411), we get a palindrome (41514355341514).
The spelling of 11412232120103 in words is "eleven trillion, four hundred twelve billion, two hundred thirty-two million, one hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •