Base | Representation |
---|---|
bin | 1001010010011110011000… |
… | …1111100110110001010001 |
3 | 1100011100112112112010010002 |
4 | 2110213212033212301101 |
5 | 2314312211012110413 |
6 | 33415442032415345 |
7 | 2102602443420131 |
oct | 224474617466121 |
9 | 40140475463102 |
10 | 10213000113233 |
11 | 3288344347755 |
12 | 118b4210a7555 |
13 | 59110a888a98 |
14 | 2744519a8ac1 |
15 | 12a9e483c958 |
hex | 949e63e6c51 |
10213000113233 has 8 divisors (see below), whose sum is σ = 10264118342400. Its totient is φ = 10161951767968.
The previous prime is 10213000113137. The next prime is 10213000113257. The reversal of 10213000113233 is 33231100031201.
10213000113233 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10213000113233 - 228 = 10212731677777 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10213080113233) 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, 17177948 + ... + 17762541.
It is an arithmetic number, because the mean of its divisors is an integer number (1283014792800).
Almost surely, 210213000113233 is an apocalyptic number.
It is an amenable number.
10213000113233 is a deficient number, since it is larger than the sum of its proper divisors (51118229167).
10213000113233 is a wasteful number, since it uses less digits than its factorization.
10213000113233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34941951.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 10213000113233 its reverse (33231100031201), we get a palindrome (43444100144434).
The spelling of 10213000113233 in words is "ten trillion, two hundred thirteen billion, one hundred thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •