Base | Representation |
---|---|
bin | 101111101000110111… |
… | …1110010000111101011 |
3 | 100210001200112122011021 |
4 | 1133101233302013223 |
5 | 3134004110241021 |
6 | 114555240513311 |
7 | 10251111645220 |
oct | 1372157620753 |
9 | 323050478137 |
10 | 102303212011 |
11 | 3a428550400 |
12 | 179b117b837 |
13 | 9854a3a8a0 |
14 | 4d46cc7947 |
15 | 29db542c41 |
hex | 17d1bf21eb |
102303212011 has 48 divisors (see below), whose sum is σ = 138928914432. Its totient is φ = 73302863040.
The previous prime is 102303211981. The next prime is 102303212029. The reversal of 102303212011 is 110212303201.
It is not a de Polignac number, because 102303212011 - 25 = 102303211979 is a prime.
It is a super-2 number, since 2×1023032120112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102303212041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2878230 + ... + 2913556.
It is an arithmetic number, because the mean of its divisors is an integer number (2894352384).
Almost surely, 2102303212011 is an apocalyptic number.
102303212011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102303212011 is a deficient number, since it is larger than the sum of its proper divisors (36625702421).
102303212011 is a wasteful number, since it uses less digits than its factorization.
102303212011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35632 (or 35621 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102303212011 its reverse (110212303201), we get a palindrome (212515515212).
The spelling of 102303212011 in words is "one hundred two billion, three hundred three million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •