Base | Representation |
---|---|
bin | 111001010100101110… |
… | …0111000000001101111 |
3 | 102202202012010201001222 |
4 | 1302221130320001233 |
5 | 4004103103101221 |
6 | 132315143053555 |
7 | 11615403522560 |
oct | 1625134700157 |
9 | 382665121058 |
10 | 123102003311 |
11 | 48230965121 |
12 | 1ba367412bb |
13 | b7baa641a1 |
14 | 5d5b302167 |
15 | 33074979ab |
hex | 1ca973806f |
123102003311 has 8 divisors (see below), whose sum is σ = 142787825280. Its totient is φ = 103941136728.
The previous prime is 123102003307. The next prime is 123102003317. The reversal of 123102003311 is 113300201321.
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 123102003311 - 22 = 123102003307 is a prime.
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 123102003311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123102003317) 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, 131238341 + ... + 131239278.
It is an arithmetic number, because the mean of its divisors is an integer number (17848478160).
Almost surely, 2123102003311 is an apocalyptic number.
123102003311 is a deficient number, since it is larger than the sum of its proper divisors (19685821969).
123102003311 is an equidigital number, since it uses as much as digits as its factorization.
123102003311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262477693.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 123102003311 its reverse (113300201321), we get a palindrome (236402204632).
The spelling of 123102003311 in words is "one hundred twenty-three billion, one hundred two million, three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •