Base | Representation |
---|---|
bin | 10111001111100011100111… |
… | …010000001011010001111001 |
3 | 111101221112021101112011112220 |
4 | 113033203213100023101321 |
5 | 101344314424431002301 |
6 | 1001225034234554253 |
7 | 30350306346252333 |
oct | 2717434720132171 |
9 | 441845241464486 |
10 | 102224101422201 |
11 | 2a631aa8304400 |
12 | b56b870898989 |
13 | 45068cb016745 |
14 | 1b3595c660453 |
15 | bc413ba98936 |
hex | 5cf8e740b479 |
102224101422201 has 24 divisors (see below), whose sum is σ = 150576526058112. Its totient is φ = 61639513504800.
The previous prime is 102224101422143. The next prime is 102224101422203.
102224101422201 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 102224101422201 - 215 = 102224101389433 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102224101422203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 714672385 + ... + 714815406.
It is an arithmetic number, because the mean of its divisors is an integer number (6274021919088).
Almost surely, 2102224101422201 is an apocalyptic number.
102224101422201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102224101422201 is a deficient number, since it is larger than the sum of its proper divisors (48352424635911).
102224101422201 is a wasteful number, since it uses less digits than its factorization.
102224101422201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1429488013 (or 1429488002 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 24.
It can be divided in two parts, 10222410 and 1422201, that added together give a palindrome (11644611).
The spelling of 102224101422201 in words is "one hundred two trillion, two hundred twenty-four billion, one hundred one million, four hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •