Base | Representation |
---|---|
bin | 11110100100111011001… |
… | …111111001111100111111 |
3 | 21102212122112122202112112 |
4 | 132210323033321330333 |
5 | 233411311124024043 |
6 | 4245143152124235 |
7 | 304544341042025 |
oct | 36447317717477 |
9 | 7385575582475 |
10 | 2101233033023 |
11 | 7401452a4943 |
12 | 29b29683667b |
13 | 1231b7662947 |
14 | 739b359c715 |
15 | 399d05ca518 |
hex | 1e93b3f9f3f |
2101233033023 has 16 divisors (see below), whose sum is σ = 2303297596800. Its totient is φ = 1909039343616.
The previous prime is 2101233032963. The next prime is 2101233033043. The reversal of 2101233033023 is 3203303321012.
It is a cyclic number.
It is not a de Polignac number, because 2101233033023 - 212 = 2101233028927 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2101233033023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101233033043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17954198 + ... + 18070851.
It is an arithmetic number, because the mean of its divisors is an integer number (143956099800).
Almost surely, 22101233033023 is an apocalyptic number.
2101233033023 is a deficient number, since it is larger than the sum of its proper divisors (202064563777).
2101233033023 is a wasteful number, since it uses less digits than its factorization.
2101233033023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36025186.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 2101233033023 its reverse (3203303321012), we get a palindrome (5304536354035).
The spelling of 2101233033023 in words is "two trillion, one hundred one billion, two hundred thirty-three million, thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •