Base | Representation |
---|---|
bin | 1001010001110101110101… |
… | …0001100110000000100111 |
3 | 1100010022102202000220010110 |
4 | 2110131131101212000213 |
5 | 2314122411212034343 |
6 | 33410441411224103 |
7 | 2102035565025546 |
oct | 224353521460047 |
9 | 40108382026113 |
10 | 10202112221223 |
11 | 328376742029a |
12 | 11892a28a8033 |
13 | 590093c54130 |
14 | 273adb95c15d |
15 | 12a5a8a45833 |
hex | 9475d466027 |
10202112221223 has 32 divisors (see below), whose sum is σ = 15263066068992. Its totient is φ = 6018917270400.
The previous prime is 10202112221183. The next prime is 10202112221299. The reversal of 10202112221223 is 32212221120201.
It is not a de Polignac number, because 10202112221223 - 28 = 10202112220967 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10202112221223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10202112221023) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 39302748 + ... + 39561473.
It is an arithmetic number, because the mean of its divisors is an integer number (476970814656).
Almost surely, 210202112221223 is an apocalyptic number.
10202112221223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10202112221223 is a deficient number, since it is larger than the sum of its proper divisors (5060953847769).
10202112221223 is a wasteful number, since it uses less digits than its factorization.
10202112221223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78864375.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 10202112221223 its reverse (32212221120201), we get a palindrome (42414333341424).
The spelling of 10202112221223 in words is "ten trillion, two hundred two billion, one hundred twelve million, two hundred twenty-one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •