Base | Representation |
---|---|
bin | 10110111111001110100101… |
… | …011001001001000101110101 |
3 | 111020222020221220120111011010 |
4 | 112333032211121021011311 |
5 | 101222423404030341041 |
6 | 555005342221502433 |
7 | 30203244025531164 |
oct | 2677164531110565 |
9 | 436866856514133 |
10 | 101102010012021 |
11 | 2a23a137a22a27 |
12 | b40a2b6711a19 |
13 | 4454b56492735 |
14 | 1ad751321d3db |
15 | ba4d6695ea16 |
hex | 5bf3a5649175 |
101102010012021 has 8 divisors (see below), whose sum is σ = 134821384454464. Its totient is φ = 67391987788800.
The previous prime is 101102010011909. The next prime is 101102010012079. The reversal of 101102010012021 is 120210010201101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101102010012021 - 225 = 101101976457589 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101102010011988 and 101102010012006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101102010012821) 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, 2338029580 + ... + 2338072821.
It is an arithmetic number, because the mean of its divisors is an integer number (16852673056808).
Almost surely, 2101102010012021 is an apocalyptic number.
It is an amenable number.
101102010012021 is a deficient number, since it is larger than the sum of its proper divisors (33719374442443).
101102010012021 is an equidigital number, since it uses as much as digits as its factorization.
101102010012021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4676109611.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101102010012021 its reverse (120210010201101), we get a palindrome (221312020213122).
The spelling of 101102010012021 in words is "one hundred one trillion, one hundred two billion, ten million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •