Base | Representation |
---|---|
bin | 11101000111000001010… |
… | …00110101000011011000 |
3 | 10112121200202001001121210 |
4 | 32203200220311003120 |
5 | 112341403002241440 |
6 | 2043252555103120 |
7 | 132155630012205 |
oct | 16434050650330 |
9 | 3477622031553 |
10 | 1000201212120 |
11 | 356201566600 |
12 | 141a19441aa0 |
13 | 7341ab88776 |
14 | 365a5062cac |
15 | 1b03e25ea80 |
hex | e8e0a350d8 |
1000201212120 has 96 divisors (see below), whose sum is σ = 3298184210160. Its totient is φ = 242473017600.
The previous prime is 1000201212071. The next prime is 1000201212133. The reversal of 1000201212120 is 212121020001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1000201212096 and 1000201212105.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34427671 + ... + 34456710.
Almost surely, 21000201212120 is an apocalyptic number.
1000201212120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1000201212120 is an abundant number, since it is smaller than the sum of its proper divisors (2297982998040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000201212120 is a wasteful number, since it uses less digits than its factorization.
1000201212120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68884417 (or 68884402 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1000201212120 its reverse (212121020001), we get a palindrome (1212322232121).
The spelling of 1000201212120 in words is "one trillion, two hundred one million, two hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •