Base | Representation |
---|---|
bin | 10111001100010100111101… |
… | …011111100100110101001000 |
3 | 111101011022112101200000121001 |
4 | 113030110331133210311020 |
5 | 101332201011230001300 |
6 | 1000535100211424344 |
7 | 30325262565266506 |
oct | 2714247537446510 |
9 | 441138471600531 |
10 | 102002210000200 |
11 | 2a556992397904 |
12 | b5348658b50b4 |
13 | 44bb9c8500633 |
14 | 1b28d0cdc3676 |
15 | bbd4a17e216a |
hex | 5cc53d7e4d48 |
102002210000200 has 48 divisors (see below), whose sum is σ = 237463532806500. Its totient is φ = 40747826872320.
The previous prime is 102002210000149. The next prime is 102002210000231. The reversal of 102002210000200 is 2000012200201.
It can be written as a sum of positive squares in 6 ways, for example, as 6709353618564 + 95292856381636 = 2590242^2 + 9761806^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 331452865 + ... + 331760464.
Almost surely, 2102002210000200 is an apocalyptic number.
102002210000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102002210000200 is an abundant number, since it is smaller than the sum of its proper divisors (135461322806300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102002210000200 is a wasteful number, since it uses less digits than its factorization.
102002210000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 663214114 (or 663214105 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 102002210000200 its reverse (2000012200201), we get a palindrome (104002222200401).
The spelling of 102002210000200 in words is "one hundred two trillion, two billion, two hundred ten million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •