Base | Representation |
---|---|
bin | 1001000111010011111010… |
… | …1011010011110010101111 |
3 | 1022111000111101001012022011 |
4 | 2101310332223103302233 |
5 | 2303141414310222343 |
6 | 33151402550102051 |
7 | 2053002634415215 |
oct | 221647653236257 |
9 | 38430441035264 |
10 | 10021210242223 |
11 | 3213a75a24a24 |
12 | 115a21704a927 |
13 | 578cc44a24cb |
14 | 26905a04ccb5 |
15 | 125a1c06e29d |
hex | 91d3ead3caf |
10021210242223 has 8 divisors (see below), whose sum is σ = 10023342256368. Its totient is φ = 10019078405184.
The previous prime is 10021210242179. The next prime is 10021210242227. The reversal of 10021210242223 is 32224201212001.
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-10021210242223 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10021210242194 and 10021210242203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10021210242227) 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, 201418636 + ... + 201468382.
It is an arithmetic number, because the mean of its divisors is an integer number (1252917782046).
Almost surely, 210021210242223 is an apocalyptic number.
10021210242223 is a deficient number, since it is larger than the sum of its proper divisors (2132014145).
10021210242223 is an equidigital number, since it uses as much as digits as its factorization.
10021210242223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 88553.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 10021210242223 its reverse (32224201212001), we get a palindrome (42245411454224).
The spelling of 10021210242223 in words is "ten trillion, twenty-one billion, two hundred ten million, two hundred forty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •