Base | Representation |
---|---|
bin | 101111100101110100… |
… | …1111000010000110011 |
3 | 100202210120012210000200 |
4 | 1133023221320100303 |
5 | 3133301424013021 |
6 | 114541150050243 |
7 | 10245431114034 |
oct | 1371351702063 |
9 | 322716183020 |
10 | 102201001011 |
11 | 3a3858897aa |
12 | 17982aa9983 |
13 | 98398018c5 |
14 | 4d374bca8b |
15 | 29d25a3126 |
hex | 17cba78433 |
102201001011 has 6 divisors (see below), whose sum is σ = 147623668140. Its totient is φ = 68134000668.
The previous prime is 102201000997. The next prime is 102201001031. The reversal of 102201001011 is 110100102201.
It is a happy number.
It is not a de Polignac number, because 102201001011 - 227 = 102066783283 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 11355666779 = 102201001011 / (1 + 0 + 2 + 2 + 0 + 1 + 0 + 0 + 1 + 0 + 1 + 1).
It is a junction number, because it is equal to n+sod(n) for n = 102201000984 and 102201001002.
It is not an unprimeable number, because it can be changed into a prime (102201001031) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5677833381 + ... + 5677833398.
It is an arithmetic number, because the mean of its divisors is an integer number (24603944690).
Almost surely, 2102201001011 is an apocalyptic number.
102201001011 is a deficient number, since it is larger than the sum of its proper divisors (45422667129).
102201001011 is a wasteful number, since it uses less digits than its factorization.
102201001011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11355666785 (or 11355666782 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102201001011 its reverse (110100102201), we get a palindrome (212301103212).
The spelling of 102201001011 in words is "one hundred two billion, two hundred one million, one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •