Base | Representation |
---|---|
bin | 101101101110101011101101… |
… | …010011110101001011001110 |
3 | 222101002220011222000210021220 |
4 | 231232223231103311023032 |
5 | 202330123001210014410 |
6 | 1551425150240304210 |
7 | 60235310030244003 |
oct | 5556535523651316 |
9 | 871086158023256 |
10 | 201120120001230 |
11 | 590a0622606031 |
12 | 1a682515312066 |
13 | 882b713569411 |
14 | 37943a12cd8aa |
15 | 183b8e10b2070 |
hex | b6eaed4f52ce |
201120120001230 has 32 divisors (see below), whose sum is σ = 511081716710304. Its totient is φ = 50477206588416.
The previous prime is 201120120001133. The next prime is 201120120001237. The reversal of 201120120001230 is 32100021021102.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201120120001237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 197176587727 + ... + 197176588746.
It is an arithmetic number, because the mean of its divisors is an integer number (15971303647197).
Almost surely, 2201120120001230 is an apocalyptic number.
201120120001230 is an abundant number, since it is smaller than the sum of its proper divisors (309961596709074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
201120120001230 is a wasteful number, since it uses less digits than its factorization.
201120120001230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394353176500.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 201120120001230 its reverse (32100021021102), we get a palindrome (233220141022332).
The spelling of 201120120001230 in words is "two hundred one trillion, one hundred twenty billion, one hundred twenty million, one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •