Base | Representation |
---|---|
bin | 1100001110010011111… |
… | …0100011010011111111 |
3 | 202002001021002222220212 |
4 | 3003210332203103333 |
5 | 11420040002024043 |
6 | 240250033303035 |
7 | 21112665554144 |
oct | 3034476432377 |
9 | 662037088825 |
10 | 210000033023 |
11 | 810735a9000 |
12 | 34848704a7b |
13 | 16a5901b691 |
14 | a2422523cb |
15 | 56e133c018 |
hex | 30e4fa34ff |
210000033023 has 96 divisors (see below), whose sum is σ = 264095106048. Its totient is φ = 166296049920.
The previous prime is 210000033011. The next prime is 210000033029. The reversal of 210000033023 is 320330000012.
It is not a de Polignac number, because 210000033023 - 218 = 209999770879 is a prime.
It is a super-2 number, since 2×2100000330232 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210000032989 and 210000033007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210000033029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 383912036 + ... + 383912582.
It is an arithmetic number, because the mean of its divisors is an integer number (2750990688).
Almost surely, 2210000033023 is an apocalyptic number.
210000033023 is a deficient number, since it is larger than the sum of its proper divisors (54095073025).
210000033023 is a wasteful number, since it uses less digits than its factorization.
210000033023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 682 (or 641 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 14.
Adding to 210000033023 its reverse (320330000012), we get a palindrome (530330033035).
The spelling of 210000033023 in words is "two hundred ten billion, thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •