Base | Representation |
---|---|
bin | 11101000110110110101… |
… | …01000011001110010001 |
3 | 10112121110112102210021212 |
4 | 32203123111003032101 |
5 | 112341212202004301 |
6 | 2043240054025505 |
7 | 132153465636215 |
oct | 16433325031621 |
9 | 3477415383255 |
10 | 1000112141201 |
11 | 35616625a278 |
12 | 1419b3648295 |
13 | 734055a0694 |
14 | 365972b8945 |
15 | 1b0365184bb |
hex | e8db543391 |
1000112141201 has 16 divisors (see below), whose sum is σ = 1063129257360. Its totient is φ = 937567518720.
The previous prime is 1000112141191. The next prime is 1000112141207. The reversal of 1000112141201 is 1021412110001.
1000112141201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 89616409600 + 910495731601 = 299360^2 + 954199^2 .
It is a cyclic number.
It is not a de Polignac number, because 1000112141201 - 26 = 1000112141137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1000112141207) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4307441 + ... + 4533681.
It is an arithmetic number, because the mean of its divisors is an integer number (66445578585).
Almost surely, 21000112141201 is an apocalyptic number.
It is an amenable number.
1000112141201 is a deficient number, since it is larger than the sum of its proper divisors (63017116159).
1000112141201 is a wasteful number, since it uses less digits than its factorization.
1000112141201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227284.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1000112141201 its reverse (1021412110001), we get a palindrome (2021524251202).
The spelling of 1000112141201 in words is "one trillion, one hundred twelve million, one hundred forty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •