Base | Representation |
---|---|
bin | 10111001111010110011110… |
… | …111011110011101011011100 |
3 | 111101220011212212021100112201 |
4 | 113033112132323303223130 |
5 | 101344102041311034322 |
6 | 1001214343253341244 |
7 | 30346300106443465 |
oct | 2717263673635334 |
9 | 441804785240481 |
10 | 102210003221212 |
11 | 2a627023233327 |
12 | b568b97337824 |
13 | 4505492273b93 |
14 | 1b34dc2103d6c |
15 | bc3ab4018d27 |
hex | 5cf59eef3adc |
102210003221212 has 24 divisors (see below), whose sum is σ = 189031710752640. Its totient is φ = 48222375174000.
The previous prime is 102210003221173. The next prime is 102210003221233. The reversal of 102210003221212 is 212122300012201.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 102210003221212.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2679001768 + ... + 2679039919.
It is an arithmetic number, because the mean of its divisors is an integer number (7876321281360).
Almost surely, 2102210003221212 is an apocalyptic number.
It is an amenable number.
102210003221212 is a deficient number, since it is larger than the sum of its proper divisors (86821707531428).
102210003221212 is a wasteful number, since it uses less digits than its factorization.
102210003221212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5358041961 (or 5358041959 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 102210003221212 its reverse (212122300012201), we get a palindrome (314332303233413).
The spelling of 102210003221212 in words is "one hundred two trillion, two hundred ten billion, three million, two hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •