Base | Representation |
---|---|
bin | 1001000111010011111111… |
… | …0110110001000101101101 |
3 | 1022111000112202021011110022 |
4 | 2101310333312301011231 |
5 | 2303141434341214041 |
6 | 33151404534051525 |
7 | 2053003264512200 |
oct | 221647766610555 |
9 | 38430482234408 |
10 | 10021230023021 |
11 | 3213a86105598 |
12 | 115a2217a9ba5 |
13 | 578cc8609c19 |
14 | 26905c91b937 |
15 | 125a1db7a24b |
hex | 91d3fdb116d |
10021230023021 has 6 divisors (see below), whose sum is σ = 11657349210510. Its totient is φ = 8589625733976.
The previous prime is 10021230023011. The next prime is 10021230023041. The reversal of 10021230023021 is 12032003212001.
It can be written as a sum of positive squares in only one way, i.e., 9817029969796 + 204200053225 = 3133214^2 + 451885^2 .
It is not a de Polignac number, because 10021230023021 - 214 = 10021230006637 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021230023011) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 102257449166 + ... + 102257449263.
It is an arithmetic number, because the mean of its divisors is an integer number (1942891535085).
Almost surely, 210021230023021 is an apocalyptic number.
It is an amenable number.
10021230023021 is a deficient number, since it is larger than the sum of its proper divisors (1636119187489).
10021230023021 is an equidigital number, since it uses as much as digits as its factorization.
10021230023021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 204514898443 (or 204514898436 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10021230023021 its reverse (12032003212001), we get a palindrome (22053233235022).
The spelling of 10021230023021 in words is "ten trillion, twenty-one billion, two hundred thirty million, twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •