Base | Representation |
---|---|
bin | 10110111101000010… |
… | …10100001101110111 |
3 | 1011210211021221021000 |
4 | 23132201110031313 |
5 | 200214220210403 |
6 | 5354453054343 |
7 | 614244362151 |
oct | 133641241567 |
9 | 34724257230 |
10 | 12323210103 |
11 | 5254149166 |
12 | 247b0273b3 |
13 | 12150cabc9 |
14 | 84c913ad1 |
15 | 4c1d167a3 |
hex | 2de854377 |
12323210103 has 16 divisors (see below), whose sum is σ = 18529096960. Its totient is φ = 8092853208.
The previous prime is 12323210101. The next prime is 12323210129. The reversal of 12323210103 is 30101232321.
It is not a de Polignac number, because 12323210103 - 21 = 12323210101 is a prime.
It is a super-3 number, since 3×123232101033 (a number of 31 digits) contains 333 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12323210101) 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 15 ways as a sum of consecutive naturals, for example, 3404275 + ... + 3407892.
It is an arithmetic number, because the mean of its divisors is an integer number (1158068560).
Almost surely, 212323210103 is an apocalyptic number.
12323210103 is a deficient number, since it is larger than the sum of its proper divisors (6205886857).
12323210103 is an equidigital number, since it uses as much as digits as its factorization.
12323210103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6812243 (or 6812237 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 12323210103 its reverse (30101232321), we get a palindrome (42424442424).
The spelling of 12323210103 in words is "twelve billion, three hundred twenty-three million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •