Base | Representation |
---|---|
bin | 1011001100101101111010… |
… | …1011100001000101100011 |
3 | 1121121010021221221220220110 |
4 | 2303023132223201011203 |
5 | 3103214223212020003 |
6 | 42104322103342403 |
7 | 2410410253661460 |
oct | 263133653410543 |
9 | 47533257856813 |
10 | 12313112220003 |
11 | 3a17a63934061 |
12 | 146a444451a03 |
13 | 6b4176c21b4a |
14 | 307d5a33c667 |
15 | 16545b7eba03 |
hex | b32deae1163 |
12313112220003 has 32 divisors (see below), whose sum is σ = 18930097036800. Its totient is φ = 6973548537600.
The previous prime is 12313112219999. The next prime is 12313112220023. The reversal of 12313112220003 is 30002221131321.
It is not a de Polignac number, because 12313112220003 - 22 = 12313112219999 is a prime.
It is a super-2 number, since 2×123131122200032 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (12313112220023) 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 31 ways as a sum of consecutive naturals, for example, 2875473 + ... + 5735378.
It is an arithmetic number, because the mean of its divisors is an integer number (591565532400).
Almost surely, 212313112220003 is an apocalyptic number.
12313112220003 is a deficient number, since it is larger than the sum of its proper divisors (6616984816797).
12313112220003 is a wasteful number, since it uses less digits than its factorization.
12313112220003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8611467.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 12313112220003 its reverse (30002221131321), we get a palindrome (42315333351324).
The spelling of 12313112220003 in words is "twelve trillion, three hundred thirteen billion, one hundred twelve million, two hundred twenty thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •