Base | Representation |
---|---|
bin | 10111001111101011111010… |
… | …010100010100011100010001 |
3 | 111101222101021022212021200122 |
4 | 113033223322110110130101 |
5 | 101344441201332210001 |
6 | 1001233110314400025 |
7 | 30351043215225140 |
oct | 2717537224243421 |
9 | 441871238767618 |
10 | 102233011210001 |
11 | 2a63585a6898a1 |
12 | b571538730015 |
13 | 45076bab9c329 |
14 | 1b36165ab1757 |
15 | bc44adda5b1b |
hex | 5cfafa514711 |
102233011210001 has 4 divisors (see below), whose sum is σ = 116837727097152. Its totient is φ = 87628295322852.
The previous prime is 102233011209997. The next prime is 102233011210049. The reversal of 102233011210001 is 100012110332201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102233011210001 - 22 = 102233011209997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102233011210201) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7302357943565 + ... + 7302357943578.
It is an arithmetic number, because the mean of its divisors is an integer number (29209431774288).
Almost surely, 2102233011210001 is an apocalyptic number.
It is an amenable number.
102233011210001 is a deficient number, since it is larger than the sum of its proper divisors (14604715887151).
102233011210001 is an equidigital number, since it uses as much as digits as its factorization.
102233011210001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14604715887150.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 102233011210001 its reverse (100012110332201), we get a palindrome (202245121542202).
The spelling of 102233011210001 in words is "one hundred two trillion, two hundred thirty-three billion, eleven million, two hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •