Base | Representation |
---|---|
bin | 11110100101101010010… |
… | …101100001000110010001 |
3 | 21102221200121011221002120 |
4 | 132211222111201012101 |
5 | 233414420344030413 |
6 | 4245353412404453 |
7 | 304603042656444 |
oct | 36455225410621 |
9 | 7387617157076 |
10 | 2102023033233 |
11 | 740510225782 |
12 | 29b477316729 |
13 | 1232b22240a6 |
14 | 73a4a48365b |
15 | 39a29b29723 |
hex | 1e96a561191 |
2102023033233 has 4 divisors (see below), whose sum is σ = 2802697377648. Its totient is φ = 1401348688820.
The previous prime is 2102023033219. The next prime is 2102023033261. The reversal of 2102023033233 is 3323303202012.
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 2102023033233 - 212 = 2102023029137 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2102023033213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 350337172203 + ... + 350337172208.
It is an arithmetic number, because the mean of its divisors is an integer number (700674344412).
Almost surely, 22102023033233 is an apocalyptic number.
It is an amenable number.
2102023033233 is a deficient number, since it is larger than the sum of its proper divisors (700674344415).
2102023033233 is an equidigital number, since it uses as much as digits as its factorization.
2102023033233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 700674344414.
The product of its (nonzero) digits is 3888, while the sum is 24.
Adding to 2102023033233 its reverse (3323303202012), we get a palindrome (5425326235245).
The spelling of 2102023033233 in words is "two trillion, one hundred two billion, twenty-three million, thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •