Base | Representation |
---|---|
bin | 101101110100100001010000… |
… | …110111000000011000101110 |
3 | 222102112020111110102212000101 |
4 | 231310201100313000120232 |
5 | 202403210430331000402 |
6 | 1552333323231021314 |
7 | 60306266514115105 |
oct | 5564412067003056 |
9 | 872466443385011 |
10 | 201521222125102 |
11 | 59235741273400 |
12 | 1a7281b566a83a |
13 | 885a4a6320059 |
14 | 37a99719c503c |
15 | 1847069610b87 |
hex | b74850dc062e |
201521222125102 has 12 divisors (see below), whose sum is σ = 332260196809968. Its totient is φ = 91600555511300.
The previous prime is 201521222125087. The next prime is 201521222125117.
It is a happy number.
201521222125102 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (201521222125087) and next prime (201521222125117).
It is a super-2 number, since 2×2015212221251022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 416366161174 + ... + 416366161657.
It is an arithmetic number, because the mean of its divisors is an integer number (27688349734164).
Almost surely, 2201521222125102 is an apocalyptic number.
201521222125102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
201521222125102 is a deficient number, since it is larger than the sum of its proper divisors (130738974684866).
201521222125102 is a wasteful number, since it uses less digits than its factorization.
201521222125102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 832732322855 (or 832732322844 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 28.
The spelling of 201521222125102 in words is "two hundred one trillion, five hundred twenty-one billion, two hundred twenty-two million, one hundred twenty-five thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •