Base | Representation |
---|---|
bin | 11101011001101010101… |
… | …01110110000100011100 |
3 | 10120120112102112122020102 |
4 | 32230311111312010130 |
5 | 113022403312433000 |
6 | 2052030214040232 |
7 | 132662000206361 |
oct | 16546525660434 |
9 | 3516472478212 |
10 | 1010212233500 |
11 | 35a479519098 |
12 | 143952049078 |
13 | 74354c34662 |
14 | 36c74854468 |
15 | 1b4280983d5 |
hex | eb3557611c |
1010212233500 has 24 divisors (see below), whose sum is σ = 2206303519056. Its totient is φ = 404084893200.
The previous prime is 1010212233497. The next prime is 1010212233509. The reversal of 1010212233500 is 53322120101.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010212233509) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1010211734 + ... + 1010212733.
It is an arithmetic number, because the mean of its divisors is an integer number (91929313294).
Almost surely, 21010212233500 is an apocalyptic number.
1010212233500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1010212233500 is an abundant number, since it is smaller than the sum of its proper divisors (1196091285556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1010212233500 is a wasteful number, since it uses less digits than its factorization.
1010212233500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2020424486 (or 2020424474 counting only the distinct ones).
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 1010212233500 its reverse (53322120101), we get a palindrome (1063534353601).
The spelling of 1010212233500 in words is "one trillion, ten billion, two hundred twelve million, two hundred thirty-three thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •