Base | Representation |
---|---|
bin | 10111001101110001000101… |
… | …000011011110110110010001 |
3 | 111101111202211200100120020012 |
4 | 113031301011003132312101 |
5 | 101340311044000214301 |
6 | 1001052335115524305 |
7 | 30335363650625405 |
oct | 2715610503366621 |
9 | 441452750316205 |
10 | 102101121101201 |
11 | 2a59492a0aaa82 |
12 | b54ba6aa59695 |
13 | 44c812c548131 |
14 | 1b2da13595105 |
15 | bc0d40139ebb |
hex | 5cdc450ded91 |
102101121101201 has 16 divisors (see below), whose sum is σ = 104257332916944. Its totient is φ = 99965413592064.
The previous prime is 102101121101197. The next prime is 102101121101249.
102101121101201 is nontrivially palindromic in base 10.
It can be written as a sum of positive squares in 8 ways, for example, as 16260451380625 + 85840669720576 = 4032425^2 + 9265024^2 .
It is a cyclic number.
It is not a de Polignac number, because 102101121101201 - 22 = 102101121101197 is a prime.
It is a super-2 number, since 2×1021011211012012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102101121107201) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 852395351 + ... + 852515123.
It is an arithmetic number, because the mean of its divisors is an integer number (6516083307309).
Almost surely, 2102101121101201 is an apocalyptic number.
It is an amenable number.
102101121101201 is a deficient number, since it is larger than the sum of its proper divisors (2156211815743).
102101121101201 is a wasteful number, since it uses less digits than its factorization.
102101121101201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205220.
The product of its (nonzero) digits is 8, while the sum is 14.
The spelling of 102101121101201 in words is "one hundred two trillion, one hundred one billion, one hundred twenty-one million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •