Base | Representation |
---|---|
bin | 10000000010010100100… |
… | …000101011001000010110 |
3 | 10220100110111110221100122 |
4 | 100002110200223020112 |
5 | 121023400311033024 |
6 | 2202130413311542 |
7 | 142421444553023 |
oct | 20022440531026 |
9 | 3810414427318 |
10 | 1102003221014 |
11 | 3953a20a8653 |
12 | 1596aa7955b2 |
13 | 7cbc2b0c757 |
14 | 3b4a156054a |
15 | 1d9eb79cd5e |
hex | 1009482b216 |
1102003221014 has 32 divisors (see below), whose sum is σ = 1688677230240. Its totient is φ = 539206790400.
The previous prime is 1102003220971. The next prime is 1102003221037. The reversal of 1102003221014 is 4101223002011.
It is a super-2 number, since 2×11020032210142 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1102003220983 and 1102003221001.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36682952 + ... + 36712980.
It is an arithmetic number, because the mean of its divisors is an integer number (52771163445).
Almost surely, 21102003221014 is an apocalyptic number.
1102003221014 is a deficient number, since it is larger than the sum of its proper divisors (586674009226).
1102003221014 is a wasteful number, since it uses less digits than its factorization.
1102003221014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31616.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1102003221014 its reverse (4101223002011), we get a palindrome (5203226223025).
The spelling of 1102003221014 in words is "one trillion, one hundred two billion, three million, two hundred twenty-one thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •