Base | Representation |
---|---|
bin | 11101110000000010010… |
… | …11100011001001010000 |
3 | 10121201112102002001210021 |
4 | 32320001023203021100 |
5 | 113222002314134300 |
6 | 2101334033313224 |
7 | 133565420546602 |
oct | 16700113431120 |
9 | 3551472061707 |
10 | 1022222021200 |
11 | 364581755376 |
12 | 146144105814 |
13 | 7551a115203 |
14 | 3769389d172 |
15 | 1b8cc5edd1a |
hex | ee012e3250 |
1022222021200 has 30 divisors (see below), whose sum is σ = 2455888406894. Its totient is φ = 408888808320.
The previous prime is 1022222021173. The next prime is 1022222021207. The reversal of 1022222021200 is 21202222201.
It can be written as a sum of positive squares in 3 ways, for example, as 293083642384 + 729138378816 = 541372^2 + 853896^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1022222021207) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1277777127 + ... + 1277777926.
Almost surely, 21022222021200 is an apocalyptic number.
1022222021200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1022222021200 is an abundant number, since it is smaller than the sum of its proper divisors (1433666385694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1022222021200 is a wasteful number, since it uses less digits than its factorization.
1022222021200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2555555071 (or 2555555060 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 1022222021200 its reverse (21202222201), we get a palindrome (1043424243401).
The spelling of 1022222021200 in words is "one trillion, twenty-two billion, two hundred twenty-two million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •