Base | Representation |
---|---|
bin | 1001100100000011100111… |
… | …10000101110001001101000 |
3 | 2202110110100222011122110220 |
4 | 10302001303300232021220 |
5 | 10224024122110024000 |
6 | 112421032343410040 |
7 | 4300242350600034 |
oct | 462016360561150 |
9 | 82413328148426 |
10 | 21030102033000 |
11 | 67788a8386955 |
12 | 2437936753920 |
13 | b9718cb1a608 |
14 | 529c104ad1c4 |
15 | 26709417d1a0 |
hex | 132073c2e268 |
21030102033000 has 128 divisors (see below), whose sum is σ = 65619073278720. Its totient is φ = 5607586617600.
The previous prime is 21030102032983. The next prime is 21030102033023. The reversal of 21030102033000 is 33020103012.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 38842149 + ... + 39379851.
It is an arithmetic number, because the mean of its divisors is an integer number (512649009990).
Almost surely, 221030102033000 is an apocalyptic number.
21030102033000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21030102033000 is an abundant number, since it is smaller than the sum of its proper divisors (44588971245720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21030102033000 is a wasteful number, since it uses less digits than its factorization.
21030102033000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550764 (or 550750 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 21030102033000 its reverse (33020103012), we get a palindrome (21063122136012).
The spelling of 21030102033000 in words is "twenty-one trillion, thirty billion, one hundred two million, thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •