Base | Representation |
---|---|
bin | 1010111011010000000001… |
… | …1001011101111101010111 |
3 | 1120112102201201201000021211 |
4 | 2232310000121131331113 |
5 | 3033310141213000343 |
6 | 41314413200322251 |
7 | 2346625041633130 |
oct | 256640031357527 |
9 | 46472651630254 |
10 | 12013030203223 |
11 | 39117744093a5 |
12 | 1420257613387 |
13 | 691a93107bca |
14 | 2d761036ac87 |
15 | 15c746d3b79d |
hex | aed0065df57 |
12013030203223 has 8 divisors (see below), whose sum is σ = 14100236223392. Its totient is φ = 10018588895136.
The previous prime is 12013030203221. The next prime is 12013030203259. The reversal of 12013030203223 is 32230203031021.
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 12013030203223 - 21 = 12013030203221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12013030203194 and 12013030203203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12013030203221) 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, 23191177740 + ... + 23191178257.
It is an arithmetic number, because the mean of its divisors is an integer number (1762529527924).
Almost surely, 212013030203223 is an apocalyptic number.
12013030203223 is a deficient number, since it is larger than the sum of its proper divisors (2087206020169).
12013030203223 is an equidigital number, since it uses as much as digits as its factorization.
12013030203223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 46382356041.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 12013030203223 its reverse (32230203031021), we get a palindrome (44243233234244).
The spelling of 12013030203223 in words is "twelve trillion, thirteen billion, thirty million, two hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •