Base | Representation |
---|---|
bin | 101000101101… |
… | …1011011010010 |
3 | 1111011111012200 |
4 | 1101123123102 |
5 | 20431033002 |
6 | 2041304030 |
7 | 346303146 |
oct | 121333322 |
9 | 44144180 |
10 | 21346002 |
11 | 1105a627 |
12 | 7195016 |
13 | 4564c92 |
14 | 2b99226 |
15 | 1d19b1c |
hex | 145b6d2 |
21346002 has 12 divisors (see below), whose sum is σ = 46249710. Its totient is φ = 7115328.
The previous prime is 21345997. The next prime is 21346007. The reversal of 21346002 is 20064312.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (21345997) and next prime (21346007).
It can be written as a sum of positive squares in only one way, i.e., 21261321 + 84681 = 4611^2 + 291^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 1185889 = 21346002 / (2 + 1 + 3 + 4 + 6 + 0 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (21346007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 592927 + ... + 592962.
Almost surely, 221346002 is an apocalyptic number.
21346002 is an abundant number, since it is smaller than the sum of its proper divisors (24903708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21346002 is a wasteful number, since it uses less digits than its factorization.
21346002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1185897 (or 1185894 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
The square root of 21346002 is about 4620.1733733703. The cubic root of 21346002 is about 277.3993986444.
The spelling of 21346002 in words is "twenty-one million, three hundred forty-six thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •