Base | Representation |
---|---|
bin | 10111000000110011001010… |
… | …001110101001100111000110 |
3 | 111021100120201001221002122011 |
4 | 113000303022032221213012 |
5 | 101231211041030413110 |
6 | 555131122205124434 |
7 | 30214116130145242 |
oct | 2700631216514706 |
9 | 437316631832564 |
10 | 101210002201030 |
11 | 2a280a14780a08 |
12 | b427214b5971a |
13 | 44620a6a0bba8 |
14 | 1adc8398b3422 |
15 | ba7a8765048a |
hex | 5c0cca3a99c6 |
101210002201030 has 8 divisors (see below), whose sum is σ = 182178003961872. Its totient is φ = 40484000880408.
The previous prime is 101210002200977. The next prime is 101210002201031. The reversal of 101210002201030 is 30102200012101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 101210002201030.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101210002201031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5060500110042 + ... + 5060500110061.
It is an arithmetic number, because the mean of its divisors is an integer number (22772250495234).
Almost surely, 2101210002201030 is an apocalyptic number.
101210002201030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101210002201030 is a deficient number, since it is larger than the sum of its proper divisors (80968001760842).
101210002201030 is a wasteful number, since it uses less digits than its factorization.
101210002201030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10121000220110.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 101210002201030 its reverse (30102200012101), we get a palindrome (131312202213131).
The spelling of 101210002201030 in words is "one hundred one trillion, two hundred ten billion, two million, two hundred one thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •