Base | Representation |
---|---|
bin | 11101011101000010001… |
… | …10110001110101000100 |
3 | 10120202012102121000222121 |
4 | 32232201012301311010 |
5 | 113040104134121200 |
6 | 2052525441335324 |
7 | 133054542651562 |
oct | 16564106616504 |
9 | 3522172530877 |
10 | 1012020223300 |
11 | 36021703a639 |
12 | 144177637544 |
13 | 745826912c8 |
14 | 36da6a0aa32 |
15 | 1b4d1b7de1a |
hex | eba11b1d44 |
1012020223300 has 36 divisors (see below), whose sum is σ = 2207462599636. Its totient is φ = 402710630400.
The previous prime is 1012020223271. The next prime is 1012020223303. The reversal of 1012020223300 is 33220202101.
It can be written as a sum of positive squares in 6 ways, for example, as 27864957184 + 984155266116 = 166928^2 + 992046^2 .
It is not an unprimeable number, because it can be changed into a prime (1012020223303) 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 11 ways as a sum of consecutive naturals, for example, 26198841 + ... + 26237440.
Almost surely, 21012020223300 is an apocalyptic number.
1012020223300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1012020223300 is an abundant number, since it is smaller than the sum of its proper divisors (1195442376336).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012020223300 is a wasteful number, since it uses less digits than its factorization.
1012020223300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52436488 (or 52436481 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 1012020223300 its reverse (33220202101), we get a palindrome (1045240425401).
The spelling of 1012020223300 in words is "one trillion, twelve billion, twenty million, two hundred twenty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •