Base | Representation |
---|---|
bin | 1001100011100010011101… |
… | …11011001010011110101110 |
3 | 2202101202102121022020001000 |
4 | 10301301032323022132232 |
5 | 10223231144330104202 |
6 | 112404530321101130 |
7 | 4266042325204512 |
oct | 461611673123656 |
9 | 82352377266030 |
10 | 21012304144302 |
11 | 67712a4999729 |
12 | 24343aa1877a6 |
13 | b955b4733323 |
14 | 529002854142 |
15 | 2668a18e991c |
hex | 131c4eeca7ae |
21012304144302 has 32 divisors (see below), whose sum is σ = 47779916405760. Its totient is φ = 6841215302040.
The previous prime is 21012304144301. The next prime is 21012304144343. The reversal of 21012304144302 is 20344140321012.
21012304144302 is a `hidden beast` number, since 2 + 1 + 0 + 12 + 304 + 1 + 44 + 302 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21012304144301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4524610974 + ... + 4524615617.
It is an arithmetic number, because the mean of its divisors is an integer number (1493122387680).
Almost surely, 221012304144302 is an apocalyptic number.
21012304144302 is an abundant number, since it is smaller than the sum of its proper divisors (26767612261458).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21012304144302 is a wasteful number, since it uses less digits than its factorization.
21012304144302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9049226645 (or 9049226639 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 21012304144302 its reverse (20344140321012), we get a palindrome (41356444465314).
The spelling of 21012304144302 in words is "twenty-one trillion, twelve billion, three hundred four million, one hundred forty-four thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •