Base | Representation |
---|---|
bin | 11101001000111001101… |
… | …00111001110000101101 |
3 | 10112201022010011010000201 |
4 | 32210130310321300231 |
5 | 112400440004310333 |
6 | 2043541110353501 |
7 | 132222641111500 |
oct | 16443464716055 |
9 | 3481263133021 |
10 | 1001211010093 |
11 | 35667a571788 |
12 | 14205b65b891 |
13 | 7354c146568 |
14 | 3665d201137 |
15 | 1b09cc2917d |
hex | e91cd39c2d |
1001211010093 has 12 divisors (see below), whose sum is σ = 1164690688860. Its totient is φ = 858168592512.
The previous prime is 1001211010091. The next prime is 1001211010103. The reversal of 1001211010093 is 3900101121001.
It can be written as a sum of positive squares in 2 ways, for example, as 125289097444 + 875921912649 = 353962^2 + 935907^2 .
It is not a de Polignac number, because 1001211010093 - 21 = 1001211010091 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1001211010093.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1001211010091) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5588613 + ... + 5764981.
It is an arithmetic number, because the mean of its divisors is an integer number (97057557405).
Almost surely, 21001211010093 is an apocalyptic number.
It is an amenable number.
1001211010093 is a deficient number, since it is larger than the sum of its proper divisors (163479678767).
1001211010093 is a wasteful number, since it uses less digits than its factorization.
1001211010093 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292236 (or 292229 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 1001211010093 its reverse (3900101121001), we get a palindrome (4901312131094).
The spelling of 1001211010093 in words is "one trillion, one billion, two hundred eleven million, ten thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •