Base | Representation |
---|---|
bin | 101111100000011110… |
… | …0001010000101001101 |
3 | 100202100000222010200110 |
4 | 1133000330022011031 |
5 | 3132414414240323 |
6 | 114511245150233 |
7 | 10241116154601 |
oct | 1370074120515 |
9 | 322300863613 |
10 | 102021243213 |
11 | 3a2a337203a |
12 | 1793285b379 |
13 | 980b4b4046 |
14 | 4d1b689501 |
15 | 29c18e6793 |
hex | 17c0f0a14d |
102021243213 has 8 divisors (see below), whose sum is σ = 136030671328. Its totient is φ = 68012988624.
The previous prime is 102021243179. The next prime is 102021243271. The reversal of 102021243213 is 312342120201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102021243213 - 210 = 102021242189 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102021243213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102021243913) by changing a digit.
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, 65170 + ... + 456387.
It is an arithmetic number, because the mean of its divisors is an integer number (17003833916).
Almost surely, 2102021243213 is an apocalyptic number.
It is an amenable number.
102021243213 is a deficient number, since it is larger than the sum of its proper divisors (34009428115).
102021243213 is an equidigital number, since it uses as much as digits as its factorization.
102021243213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 586763.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 102021243213 its reverse (312342120201), we get a palindrome (414363363414).
The spelling of 102021243213 in words is "one hundred two billion, twenty-one million, two hundred forty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •