Base | Representation |
---|---|
bin | 10001011110111001000… |
… | …001011010001110010100 |
3 | 11020212000122010000020010 |
4 | 101132321001122032110 |
5 | 124140431401430400 |
6 | 2315525432040220 |
7 | 152540545522314 |
oct | 21367101321624 |
9 | 4225018100203 |
10 | 1201400030100 |
11 | 423568aa6466 |
12 | 174a0a533070 |
13 | 893a367709a |
14 | 42210447444 |
15 | 213b7a89450 |
hex | 117b905a394 |
1201400030100 has 72 divisors (see below), whose sum is σ = 3485126937600. Its totient is φ = 319536826880.
The previous prime is 1201400030099. The next prime is 1201400030161. The reversal of 1201400030100 is 10300041021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5113125 + ... + 5342924.
It is an arithmetic number, because the mean of its divisors is an integer number (48404540800).
Almost surely, 21201400030100 is an apocalyptic number.
1201400030100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1201400030100 is an abundant number, since it is smaller than the sum of its proper divisors (2283726907500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1201400030100 is a wasteful number, since it uses less digits than its factorization.
1201400030100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10456449 (or 10456442 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1201400030100 its reverse (10300041021), we get a palindrome (1211700071121).
The spelling of 1201400030100 in words is "one trillion, two hundred one billion, four hundred million, thirty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •