Base | Representation |
---|---|
bin | 1001000111010011111010… |
… | …1011001111011001011111 |
3 | 1022111000111101000021121111 |
4 | 2101310332223033121133 |
5 | 2303141414304133343 |
6 | 33151402545442451 |
7 | 2053002634311562 |
oct | 221647653173137 |
9 | 38430441007544 |
10 | 10021210224223 |
11 | 3213a75a12450 |
12 | 115a217040427 |
13 | 578cc4497263 |
14 | 26905a0464d9 |
15 | 125a1c068c9d |
hex | 91d3eacf65f |
10021210224223 has 8 divisors (see below), whose sum is σ = 11063942942976. Its totient is φ = 9000429773400.
The previous prime is 10021210224217. The next prime is 10021210224299. The reversal of 10021210224223 is 32242201212001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10021210224223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10021210224194 and 10021210224203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021210221223) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5488066023 + ... + 5488067848.
It is an arithmetic number, because the mean of its divisors is an integer number (1382992867872).
Almost surely, 210021210224223 is an apocalyptic number.
10021210224223 is a deficient number, since it is larger than the sum of its proper divisors (1042732718753).
10021210224223 is a wasteful number, since it uses less digits than its factorization.
10021210224223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10976133965.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 10021210224223 its reverse (32242201212001), we get a palindrome (42263411436224).
The spelling of 10021210224223 in words is "ten trillion, twenty-one billion, two hundred ten million, two hundred twenty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •