Base | Representation |
---|---|
bin | 11101001000111000011… |
… | …11011110111101110100 |
3 | 10112201021102200202111102 |
4 | 32210130033132331310 |
5 | 112400430001413022 |
6 | 2043540120225232 |
7 | 132222461535545 |
oct | 16443417367564 |
9 | 3481242622442 |
10 | 1001201201012 |
11 | 356674a82001 |
12 | 14205830b218 |
13 | 7354a0c087c |
14 | 3665bbaa4cc |
15 | 1b09be3ca92 |
hex | e91c3def74 |
1001201201012 has 6 divisors (see below), whose sum is σ = 1752102101778. Its totient is φ = 500600600504.
The previous prime is 1001201200997. The next prime is 1001201201017. The reversal of 1001201201012 is 2101021021001.
It can be written as a sum of positive squares in only one way, i.e., 1000812164836 + 389036176 = 1000406^2 + 19724^2 .
It is a super-3 number, since 3×10012012010123 (a number of 37 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1001201200984 and 1001201201002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001201201017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 125150150123 + ... + 125150150130.
It is an arithmetic number, because the mean of its divisors is an integer number (292017016963).
Almost surely, 21001201201012 is an apocalyptic number.
It is an amenable number.
1001201201012 is a deficient number, since it is larger than the sum of its proper divisors (750900900766).
1001201201012 is a wasteful number, since it uses less digits than its factorization.
1001201201012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 250300300257 (or 250300300255 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1001201201012 its reverse (2101021021001), we get a palindrome (3102222222013).
The spelling of 1001201201012 in words is "one trillion, one billion, two hundred one million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •