Base | Representation |
---|---|
bin | 1001100011001111101101… |
… | …01101110011010101101011 |
3 | 2202100210102211010202001200 |
4 | 10301213312231303111223 |
5 | 10223100033440441133 |
6 | 112400143201415243 |
7 | 4265234642065125 |
oct | 461476655632553 |
9 | 82323384122050 |
10 | 21002234312043 |
11 | 6767aa7818706 |
12 | 243245993a523 |
13 | b9466b4357ba |
14 | 528729314215 |
15 | 2664b2845913 |
hex | 1319f6b7356b |
21002234312043 has 12 divisors (see below), whose sum is σ = 30752129998200. Its totient is φ = 13809688314336.
The previous prime is 21002234312011. The next prime is 21002234312063. The reversal of 21002234312043 is 34021343220012.
21002234312043 is a `hidden beast` number, since 2 + 1 + 0 + 0 + 2 + 23 + 431 + 204 + 3 = 666.
It is not a de Polignac number, because 21002234312043 - 25 = 21002234312011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21002234311998 and 21002234312016.
It is not an unprimeable number, because it can be changed into a prime (21002234312063) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15983434893 + ... + 15983436206.
It is an arithmetic number, because the mean of its divisors is an integer number (2562677499850).
Almost surely, 221002234312043 is an apocalyptic number.
21002234312043 is a deficient number, since it is larger than the sum of its proper divisors (9749895686157).
21002234312043 is a wasteful number, since it uses less digits than its factorization.
21002234312043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31966871178 (or 31966871175 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 21002234312043 its reverse (34021343220012), we get a palindrome (55023577532055).
The spelling of 21002234312043 in words is "twenty-one trillion, two billion, two hundred thirty-four million, three hundred twelve thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •