Base | Representation |
---|---|
bin | 10000000000011110010… |
… | …111000110101100110101 |
3 | 10220011100100120201201001 |
4 | 100000132113012230311 |
5 | 121010320334013023 |
6 | 2201202003403301 |
7 | 142321355142664 |
oct | 20003627065465 |
9 | 3804310521631 |
10 | 1100021001013 |
11 | 3945751a5400 |
12 | 159236983531 |
13 | 7c96824c1cc |
14 | 3b3541b2ddb |
15 | 1d93274d6ad |
hex | 1001e5c6b35 |
1100021001013 has 12 divisors (see below), whose sum is σ = 1209367212480. Its totient is φ = 999809662280.
The previous prime is 1100021000971. The next prime is 1100021001029. The reversal of 1100021001013 is 3101001200011.
It is not a de Polignac number, because 1100021001013 - 213 = 1100020992821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100021001713) 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, 370333 + ... + 1528786.
It is an arithmetic number, because the mean of its divisors is an integer number (100780601040).
Almost surely, 21100021001013 is an apocalyptic number.
It is an amenable number.
1100021001013 is a deficient number, since it is larger than the sum of its proper divisors (109346211467).
1100021001013 is a wasteful number, since it uses less digits than its factorization.
1100021001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1903928 (or 1903917 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 1100021001013 its reverse (3101001200011), we get a palindrome (4201022201024).
The spelling of 1100021001013 in words is "one trillion, one hundred billion, twenty-one million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •