Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …010101010000011111111 |
3 | 21002012100102220112021011 |
4 | 131012221102222003333 |
5 | 230232000002024043 |
6 | 4130442021420051 |
7 | 264331602533236 |
oct | 35065122520377 |
9 | 7065312815234 |
10 | 2000000033023 |
11 | 701216973683 |
12 | 283743b6a627 |
13 | 1167a3576405 |
14 | 6cb2c89bb1d |
15 | 37057ed759d |
hex | 1d1a94aa0ff |
2000000033023 has 8 divisors (see below), whose sum is σ = 2001470083200. Its totient is φ = 1998530526720.
The previous prime is 2000000032993. The next prime is 2000000033077. The reversal of 2000000033023 is 3203300000002.
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 2000000033023 - 217 = 1999999901951 is a prime.
It is a super-3 number, since 3×20000000330233 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000000032994 and 2000000033012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2000000033723) 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, 7372903 + ... + 7639351.
It is an arithmetic number, because the mean of its divisors is an integer number (250183760400).
Almost surely, 22000000033023 is an apocalyptic number.
2000000033023 is a deficient number, since it is larger than the sum of its proper divisors (1470050177).
2000000033023 is a wasteful number, since it uses less digits than its factorization.
2000000033023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271937.
The product of its (nonzero) digits is 108, while the sum is 13.
Adding to 2000000033023 its reverse (3203300000002), we get a palindrome (5203300033025).
The spelling of 2000000033023 in words is "two trillion, thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •