Base | Representation |
---|---|
bin | 1011001100000100111001… |
… | …1011101000001110000111 |
3 | 1121120001212122200000111010 |
4 | 2303001032123220032013 |
5 | 3103024201130414343 |
6 | 42055301400413303 |
7 | 2406540363240402 |
oct | 263011633501607 |
9 | 47501778600433 |
10 | 12302102201223 |
11 | 3a13323a82a8a |
12 | 1468291177233 |
13 | 6b3110bca233 |
14 | 3075d3dc0d39 |
15 | 165014e2dd33 |
hex | b304e6e8387 |
12302102201223 has 8 divisors (see below), whose sum is σ = 16553287366000. Its totient is φ = 8126159251968.
The previous prime is 12302102201173. The next prime is 12302102201239. The reversal of 12302102201223 is 32210220120321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12302102201223 - 218 = 12302101939079 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12302102201223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12302102208223) 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, 18810553498 + ... + 18810554151.
It is an arithmetic number, because the mean of its divisors is an integer number (2069160920750).
Almost surely, 212302102201223 is an apocalyptic number.
12302102201223 is a deficient number, since it is larger than the sum of its proper divisors (4251185164777).
12302102201223 is a wasteful number, since it uses less digits than its factorization.
12302102201223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37621107761.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 12302102201223 its reverse (32210220120321), we get a palindrome (44512322321544).
The spelling of 12302102201223 in words is "twelve trillion, three hundred two billion, one hundred two million, two hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •