Base | Representation |
---|---|
bin | 10110111110000011001111… |
… | …111111000111001100111000 |
3 | 111020200112011120011210221220 |
4 | 112332003033333013030320 |
5 | 101220112223234331300 |
6 | 554504243441032040 |
7 | 30164351350656402 |
oct | 2676031777071470 |
9 | 436615146153856 |
10 | 101021120230200 |
11 | 2a2088a8833675 |
12 | b3b66a0925620 |
13 | 444a334c01201 |
14 | 1ad363c227b72 |
15 | ba2bd02d1da0 |
hex | 5be0cffc7338 |
101021120230200 has 96 divisors (see below), whose sum is σ = 318299333037360. Its totient is φ = 26497343001600.
The previous prime is 101021120230183. The next prime is 101021120230223. The reversal of 101021120230200 is 2032021120101.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 101021120230200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1380033349 + ... + 1380106548.
Almost surely, 2101021120230200 is an apocalyptic number.
101021120230200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101021120230200 is an abundant number, since it is smaller than the sum of its proper divisors (217278212807160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101021120230200 is a wasteful number, since it uses less digits than its factorization.
101021120230200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2760139977 (or 2760139968 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 101021120230200 its reverse (2032021120101), we get a palindrome (103053141350301).
The spelling of 101021120230200 in words is "one hundred one trillion, twenty-one billion, one hundred twenty million, two hundred thirty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •