Base | Representation |
---|---|
bin | 101111100110000110… |
… | …0001101110001010000 |
3 | 100202211012011002001122 |
4 | 1133030030031301100 |
5 | 3133311230031000 |
6 | 114542111021412 |
7 | 10245600453011 |
oct | 1371414156120 |
9 | 322735132048 |
10 | 102210002000 |
11 | 3a38a977337 |
12 | 17985b0a868 |
13 | 983b633832 |
14 | 4d38783008 |
15 | 29d3280085 |
hex | 17cc30dc50 |
102210002000 has 40 divisors (see below), whose sum is σ = 247143789672. Its totient is φ = 40884000000.
The previous prime is 102210001979. The next prime is 102210002101. The reversal of 102210002000 is 200012201.
It can be written as a sum of positive squares in 4 ways, for example, as 874739776 + 101335262224 = 29576^2 + 318332^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25550501 + ... + 25554500.
Almost surely, 2102210002000 is an apocalyptic number.
102210002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102210002000 is an abundant number, since it is smaller than the sum of its proper divisors (144933787672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102210002000 is an equidigital number, since it uses as much as digits as its factorization.
102210002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51105024 (or 51105008 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 102210002000 its reverse (200012201), we get a palindrome (102410014201).
The spelling of 102210002000 in words is "one hundred two billion, two hundred ten million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •