Base | Representation |
---|---|
bin | 11101000111001110011… |
… | …011011110011001011110 |
3 | 21002020221212022200120200 |
4 | 131013032123132121132 |
5 | 230234234003222114 |
6 | 4131023520124330 |
7 | 264353206531431 |
oct | 35071633363136 |
9 | 7066855280520 |
10 | 2000623101534 |
11 | 701506648232 |
12 | 2838987666a6 |
13 | 11687268acc5 |
14 | 6cb8b52b818 |
15 | 37092a60409 |
hex | 1d1ce6de65e |
2000623101534 has 12 divisors (see below), whose sum is σ = 4334683386696. Its totient is φ = 666874367172.
The previous prime is 2000623101473. The next prime is 2000623101541. The reversal of 2000623101534 is 4351013260002.
2000623101534 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 6 + 23 + 101 + 534 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 2000623101498 and 2000623101507.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 55572863914 + ... + 55572863949.
It is an arithmetic number, because the mean of its divisors is an integer number (361223615558).
Almost surely, 22000623101534 is an apocalyptic number.
2000623101534 is an abundant number, since it is smaller than the sum of its proper divisors (2334060285162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2000623101534 is a wasteful number, since it uses less digits than its factorization.
2000623101534 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111145727871 (or 111145727868 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 2000623101534 its reverse (4351013260002), we get a palindrome (6351636361536).
The spelling of 2000623101534 in words is "two trillion, six hundred twenty-three million, one hundred one thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •