Base | Representation |
---|---|
bin | 10111001111001110001110… |
… | …000111010110110010010010 |
3 | 111101212022222112210222002001 |
4 | 113033032032013112302102 |
5 | 101343430404030220310 |
6 | 1001210315041144214 |
7 | 30345534205613662 |
oct | 2717161607266222 |
9 | 441768875728061 |
10 | 102201131101330 |
11 | 2a623290146348 |
12 | b56732002b06a |
13 | 45046aa1494c1 |
14 | 1b347bda9a1a2 |
15 | bc374519c93a |
hex | 5cf38e1d6c92 |
102201131101330 has 16 divisors (see below), whose sum is σ = 193644248402880. Its totient is φ = 38728849680432.
The previous prime is 102201131101309. The next prime is 102201131101337. The reversal of 102201131101330 is 33101131102201.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a junction number, because it is equal to n+sod(n) for n = 102201131101298 and 102201131101307.
It is not an unprimeable number, because it can be changed into a prime (102201131101337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 268950344814 + ... + 268950345193.
It is an arithmetic number, because the mean of its divisors is an integer number (12102765525180).
Almost surely, 2102201131101330 is an apocalyptic number.
102201131101330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102201131101330 is a deficient number, since it is larger than the sum of its proper divisors (91443117301550).
102201131101330 is a wasteful number, since it uses less digits than its factorization.
102201131101330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 537900690033.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 102201131101330 its reverse (33101131102201), we get a palindrome (135302262203531).
The spelling of 102201131101330 in words is "one hundred two trillion, two hundred one billion, one hundred thirty-one million, one hundred one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •