Base | Representation |
---|---|
bin | 10001110011001101100… |
… | …101111111010100011110 |
3 | 11022221100022020022212120 |
4 | 101303031211333110132 |
5 | 130020123310000110 |
6 | 2333534533443410 |
7 | 154242350306100 |
oct | 21631545772436 |
9 | 4287308208776 |
10 | 1223220000030 |
11 | 431845889866 |
12 | 179099aa0566 |
13 | 8b4701145b2 |
14 | 432c0323570 |
15 | 21c434a5870 |
hex | 11ccd97f51e |
1223220000030 has 48 divisors (see below), whose sum is σ = 3415030534800. Its totient is φ = 279593142528.
The previous prime is 1223220000017. The next prime is 1223220000047. The reversal of 1223220000030 is 300000223221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1223219999964 and 1223220000009.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 416059755 + ... + 416062694.
It is an arithmetic number, because the mean of its divisors is an integer number (71146469475).
Almost surely, 21223220000030 is an apocalyptic number.
1223220000030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1223220000030 is an abundant number, since it is smaller than the sum of its proper divisors (2191810534770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1223220000030 is a wasteful number, since it uses less digits than its factorization.
1223220000030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 832122473 (or 832122466 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 15.
Adding to 1223220000030 its reverse (300000223221), we get a palindrome (1523220223251).
The spelling of 1223220000030 in words is "one trillion, two hundred twenty-three billion, two hundred twenty million, thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •