Base | Representation |
---|---|
bin | 1011001100100010010101… |
… | …0011000001001110101111 |
3 | 1121120211021012120001010022 |
4 | 2303020211103001032233 |
5 | 3103141341003404403 |
6 | 42103045321032355 |
7 | 2410240216443044 |
oct | 263104523011657 |
9 | 47524235501108 |
10 | 12310002013103 |
11 | 3a16708240633 |
12 | 14699169256bb |
13 | 6b3a9c762032 |
14 | 307b432491cb |
15 | 165328738d38 |
hex | b32254c13af |
12310002013103 has 8 divisors (see below), whose sum is σ = 12785000290560. Its totient is φ = 11843882208280.
The previous prime is 12310002013091. The next prime is 12310002013117. The reversal of 12310002013103 is 30131020001321.
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 12310002013103 - 26 = 12310002013039 is a prime.
It is a super-2 number, since 2×123100020131032 (a number of 27 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 (12310002013163) 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, 2219615333 + ... + 2219620878.
It is an arithmetic number, because the mean of its divisors is an integer number (1598125036320).
Almost surely, 212310002013103 is an apocalyptic number.
12310002013103 is a deficient number, since it is larger than the sum of its proper divisors (474998277457).
12310002013103 is an equidigital number, since it uses as much as digits as its factorization.
12310002013103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4439236317.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 12310002013103 its reverse (30131020001321), we get a palindrome (42441022014424).
The spelling of 12310002013103 in words is "twelve trillion, three hundred ten billion, two million, thirteen thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.512 sec. • engine limits •