Base | Representation |
---|---|
bin | 1011001100100010110011… |
… | …1100000100000111010101 |
3 | 1121120211121010210021202222 |
4 | 2303020230330010013111 |
5 | 3103142121313311313 |
6 | 42103110140512125 |
7 | 2410243334226461 |
oct | 263105474040725 |
9 | 47524533707688 |
10 | 12310130213333 |
11 | 3a16773643337 |
12 | 146995184b645 |
13 | 6b3ac019a564 |
14 | 307b5629b4a1 |
15 | 165334b0e208 |
hex | b322cf041d5 |
12310130213333 has 4 divisors (see below), whose sum is σ = 12425178159360. Its totient is φ = 12195082267308.
The previous prime is 12310130213309. The next prime is 12310130213369. The reversal of 12310130213333 is 33331203101321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12310130213333 - 28 = 12310130213077 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12310130213533) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 57523972853 + ... + 57523973066.
It is an arithmetic number, because the mean of its divisors is an integer number (3106294539840).
Almost surely, 212310130213333 is an apocalyptic number.
It is an amenable number.
12310130213333 is a deficient number, since it is larger than the sum of its proper divisors (115047946027).
12310130213333 is a wasteful number, since it uses less digits than its factorization.
12310130213333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115047946026.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 12310130213333 its reverse (33331203101321), we get a palindrome (45641333314654).
The spelling of 12310130213333 in words is "twelve trillion, three hundred ten billion, one hundred thirty million, two hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •