Base | Representation |
---|---|
bin | 10000000010010100011… |
… | …100011100010111101111 |
3 | 10220100110102101121001102 |
4 | 100002110130130113233 |
5 | 121023400020040413 |
6 | 2202130333433315 |
7 | 142421432253503 |
oct | 20022434342757 |
9 | 3810412347042 |
10 | 1102002111983 |
11 | 3953a15103a3 |
12 | 1596aa33b83b |
13 | 7cbc2811a16 |
14 | 3b4a1352303 |
15 | 1d9eb62e458 |
hex | 1009471c5ef |
1102002111983 has 16 divisors (see below), whose sum is σ = 1200158920800. Its totient is φ = 1007870371200.
The previous prime is 1102002111949. The next prime is 1102002111989. The reversal of 1102002111983 is 3891112002011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1102002111983 - 26 = 1102002111919 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102002111989) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4226885 + ... + 4480017.
It is an arithmetic number, because the mean of its divisors is an integer number (75009932550).
Almost surely, 21102002111983 is an apocalyptic number.
1102002111983 is a deficient number, since it is larger than the sum of its proper divisors (98156808817).
1102002111983 is a wasteful number, since it uses less digits than its factorization.
1102002111983 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261082.
The product of its (nonzero) digits is 864, while the sum is 29.
Adding to 1102002111983 its reverse (3891112002011), we get a palindrome (4993114113994).
The spelling of 1102002111983 in words is "one trillion, one hundred two billion, two million, one hundred eleven thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •