Base | Representation |
---|---|
bin | 10000011101100001011… |
… | …011100001010011110011 |
3 | 11000010212001002000002101 |
4 | 100131201123201103303 |
5 | 122013210004044443 |
6 | 2223400545401231 |
7 | 144504314606515 |
oct | 20354133412363 |
9 | 4003761060071 |
10 | 1131211003123 |
11 | 3a6820136653 |
12 | 1632a0339217 |
13 | 82899017b66 |
14 | 3ca726a7bb5 |
15 | 1e65aa8a84d |
hex | 107616e14f3 |
1131211003123 has 8 divisors (see below), whose sum is σ = 1191086104320. Its totient is φ = 1071369669960.
The previous prime is 1131211003099. The next prime is 1131211003129. The reversal of 1131211003123 is 3213001121311.
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 1131211003123 - 237 = 993772049651 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1131211003123.
It is not an unprimeable number, because it can be changed into a prime (1131211003129) 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, 8373223 + ... + 8507248.
It is an arithmetic number, because the mean of its divisors is an integer number (148885763040).
Almost surely, 21131211003123 is an apocalyptic number.
1131211003123 is a deficient number, since it is larger than the sum of its proper divisors (59875101197).
1131211003123 is a wasteful number, since it uses less digits than its factorization.
1131211003123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16884017.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 1131211003123 its reverse (3213001121311), we get a palindrome (4344212124434).
The spelling of 1131211003123 in words is "one trillion, one hundred thirty-one billion, two hundred eleven million, three thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •