Base | Representation |
---|---|
bin | 1011001100001001000100… |
… | …0111100111110010000101 |
3 | 1121120011202121221102001202 |
4 | 2303002101013213302011 |
5 | 3103033444040430041 |
6 | 42100004405032245 |
7 | 2406610200154055 |
oct | 263022107476205 |
9 | 47504677842052 |
10 | 12303221030021 |
11 | 3a13848588689 |
12 | 14685439b5685 |
13 | 6b325b9411cc |
14 | 30769c821565 |
15 | 16507d283a9b |
hex | b30911e7c85 |
12303221030021 has 8 divisors (see below), whose sum is σ = 12318208984320. Its totient is φ = 12288241060272.
The previous prime is 12303221029991. The next prime is 12303221030027. The reversal of 12303221030021 is 12003012230321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12303221030021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12303221029975 and 12303221030002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12303221030027) 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, 1090400 + ... + 5078918.
It is an arithmetic number, because the mean of its divisors is an integer number (1539776123040).
Almost surely, 212303221030021 is an apocalyptic number.
It is an amenable number.
12303221030021 is a deficient number, since it is larger than the sum of its proper divisors (14987954299).
12303221030021 is a wasteful number, since it uses less digits than its factorization.
12303221030021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3992275.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 12303221030021 its reverse (12003012230321), we get a palindrome (24306233260342).
The spelling of 12303221030021 in words is "twelve trillion, three hundred three billion, two hundred twenty-one million, thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •