Base | Representation |
---|---|
bin | 10000000010110011011… |
… | …000000001000100000111 |
3 | 10220101210120212010200020 |
4 | 100002303120001010013 |
5 | 121030430341422010 |
6 | 2202254032150223 |
7 | 142440333154500 |
oct | 20026330010407 |
9 | 3811716763606 |
10 | 1102521045255 |
11 | 395638429673 |
12 | 159814098373 |
13 | 7cc76195826 |
14 | 3b510235ba7 |
15 | 1da2be87470 |
hex | 100b3601107 |
1102521045255 has 24 divisors (see below), whose sum is σ = 2052039171312. Its totient is φ = 504009620352.
The previous prime is 1102521045251. The next prime is 1102521045277. The reversal of 1102521045255 is 5525401252011.
It is not a de Polignac number, because 1102521045255 - 22 = 1102521045251 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1102521045251) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 750013582 + ... + 750015051.
It is an arithmetic number, because the mean of its divisors is an integer number (85501632138).
Almost surely, 21102521045255 is an apocalyptic number.
1102521045255 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1102521045255 is a deficient number, since it is larger than the sum of its proper divisors (949518126057).
1102521045255 is a wasteful number, since it uses less digits than its factorization.
1102521045255 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1500028655 (or 1500028648 counting only the distinct ones).
The product of its (nonzero) digits is 20000, while the sum is 33.
Adding to 1102521045255 its reverse (5525401252011), we get a palindrome (6627922297266).
The spelling of 1102521045255 in words is "one trillion, one hundred two billion, five hundred twenty-one million, forty-five thousand, two hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •