Base | Representation |
---|---|
bin | 111001010100101110… |
… | …0111111000110110111 |
3 | 102202202012012011212001 |
4 | 1302221130333012313 |
5 | 4004103110013221 |
6 | 132315143440131 |
7 | 11615404003246 |
oct | 1625134770667 |
9 | 382665164761 |
10 | 123102032311 |
11 | 48230984995 |
12 | 1ba36756047 |
13 | b7baa7444b |
14 | 5d5b30c95d |
15 | 33074a1391 |
hex | 1ca973f1b7 |
123102032311 has 4 divisors (see below), whose sum is σ = 124835863824. Its totient is φ = 121368200800.
The previous prime is 123102032309. The next prime is 123102032321. The reversal of 123102032311 is 113230201321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 123102032311 - 21 = 123102032309 is a prime.
It is a super-2 number, since 2×1231020323112 (a number of 23 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 (123102032321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 866915650 + ... + 866915791.
It is an arithmetic number, because the mean of its divisors is an integer number (31208965956).
Almost surely, 2123102032311 is an apocalyptic number.
123102032311 is a deficient number, since it is larger than the sum of its proper divisors (1733831513).
123102032311 is an equidigital number, since it uses as much as digits as its factorization.
123102032311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1733831512.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 123102032311 its reverse (113230201321), we get a palindrome (236332233632).
The spelling of 123102032311 in words is "one hundred twenty-three billion, one hundred two million, thirty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •