Base | Representation |
---|---|
bin | 11101011001101011101… |
… | …00001111100000000100 |
3 | 10120120112222112110221121 |
4 | 32230311310033200010 |
5 | 113022412332430423 |
6 | 2052031100523324 |
7 | 132662125015204 |
oct | 16546564174004 |
9 | 3516488473847 |
10 | 1010220201988 |
11 | 35a482a70a18 |
12 | 143954850544 |
13 | 7435679463a |
14 | 36c7592a404 |
15 | 1b428b1e45d |
hex | eb35d0f804 |
1010220201988 has 12 divisors (see below), whose sum is σ = 1871878609692. Its totient is φ = 475397742080.
The previous prime is 1010220201983. The next prime is 1010220201989. The reversal of 1010220201988 is 8891020220101.
It can be written as a sum of positive squares in 2 ways, for example, as 556871152644 + 453349049344 = 746238^2 + 673312^2 .
It is a super-3 number, since 3×10102202019883 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is not an unprimeable number, because it can be changed into a prime (1010220201983) 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 3 ways as a sum of consecutive naturals, for example, 7428089653 + ... + 7428089788.
It is an arithmetic number, because the mean of its divisors is an integer number (155989884141).
Almost surely, 21010220201988 is an apocalyptic number.
It is an amenable number.
1010220201988 is a deficient number, since it is larger than the sum of its proper divisors (861658407704).
1010220201988 is a wasteful number, since it uses less digits than its factorization.
1010220201988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14856179462 (or 14856179460 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 34.
The spelling of 1010220201988 in words is "one trillion, ten billion, two hundred twenty million, two hundred one thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •