Base | Representation |
---|---|
bin | 111001011011001110… |
… | …0111001010001010101 |
3 | 102210022101112210020110 |
4 | 1302312130321101111 |
5 | 4010024422042323 |
6 | 132352533553233 |
7 | 11623662441564 |
oct | 1626634712125 |
9 | 383271483213 |
10 | 123320112213 |
11 | 48332a96611 |
12 | 1ba977a5819 |
13 | b823cbbbcc |
14 | 5d7c279bdb |
15 | 331b6cc793 |
hex | 1cb6739455 |
123320112213 has 8 divisors (see below), whose sum is σ = 164457191808. Its totient is φ = 82198220384.
The previous prime is 123320112151. The next prime is 123320112239. The reversal of 123320112213 is 312211023321.
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 123320112213 - 213 = 123320104021 is a prime.
It is a super-3 number, since 3×1233201122133 (a number of 34 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 123320112213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123320117213) 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, 3777981 + ... + 3810482.
It is an arithmetic number, because the mean of its divisors is an integer number (20557148976).
Almost surely, 2123320112213 is an apocalyptic number.
It is an amenable number.
123320112213 is a deficient number, since it is larger than the sum of its proper divisors (41137079595).
123320112213 is an equidigital number, since it uses as much as digits as its factorization.
123320112213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7593883.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 123320112213 its reverse (312211023321), we get a palindrome (435531135534).
The spelling of 123320112213 in words is "one hundred twenty-three billion, three hundred twenty million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •