Base | Representation |
---|---|
bin | 10001011110101001000… |
… | …011010110011000110111 |
3 | 11020211022221221220122110 |
4 | 101132221003112120313 |
5 | 124134404304300343 |
6 | 2315443101302103 |
7 | 152531113264353 |
oct | 21365103263067 |
9 | 4224287856573 |
10 | 1201132103223 |
11 | 423440838a98 |
12 | 174954864933 |
13 | 8935ccc8a80 |
14 | 421c6a22463 |
15 | 2139e2b3833 |
hex | 117a90d6637 |
1201132103223 has 96 divisors (see below), whose sum is σ = 1885522060800. Its totient is φ = 675210961152.
The previous prime is 1201132103221. The next prime is 1201132103233. The reversal of 1201132103223 is 3223012311021.
It is not a de Polignac number, because 1201132103223 - 21 = 1201132103221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1201132103223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201132103221) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 416047086 + ... + 416049972.
It is an arithmetic number, because the mean of its divisors is an integer number (19640854800).
Almost surely, 21201132103223 is an apocalyptic number.
1201132103223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1201132103223 is a deficient number, since it is larger than the sum of its proper divisors (684389957577).
1201132103223 is a wasteful number, since it uses less digits than its factorization.
1201132103223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3989 (or 3970 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 1201132103223 its reverse (3223012311021), we get a palindrome (4424144414244).
The spelling of 1201132103223 in words is "one trillion, two hundred one billion, one hundred thirty-two million, one hundred three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •