Base | Representation |
---|---|
bin | 10001110011000000011… |
… | …111111100000111010000 |
3 | 11022220202222211221010002 |
4 | 101303000133330013100 |
5 | 130014201034411344 |
6 | 2333501045025132 |
7 | 154234042054040 |
oct | 21630037740720 |
9 | 4286688757102 |
10 | 1223000310224 |
11 | 431742878640 |
12 | 1790383b51a8 |
13 | 8b436755124 |
14 | 4329d097720 |
15 | 21c2e05c44e |
hex | 11cc07fc1d0 |
1223000310224 has 40 divisors (see below), whose sum is σ = 2954260492608. Its totient is φ = 476493626880.
The previous prime is 1223000310199. The next prime is 1223000310227. The reversal of 1223000310224 is 4220130003221.
It is a junction number, because it is equal to n+sod(n) for n = 1223000310196 and 1223000310205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1223000310227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 496346297 + ... + 496348760.
Almost surely, 21223000310224 is an apocalyptic number.
1223000310224 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1223000310224 is an abundant number, since it is smaller than the sum of its proper divisors (1731260182384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1223000310224 is a wasteful number, since it uses less digits than its factorization.
1223000310224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 992695083 (or 992695077 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 1223000310224 its reverse (4220130003221), we get a palindrome (5443130313445).
The spelling of 1223000310224 in words is "one trillion, two hundred twenty-three billion, three hundred ten thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •