Base | Representation |
---|---|
bin | 101110101000000011111… |
… | …111000000001001001011 |
3 | 102100022101002212001222001 |
4 | 232220003333000021023 |
5 | 404444010241400443 |
6 | 10451540545411431 |
7 | 450326615312434 |
oct | 56500377001113 |
9 | 12308332761861 |
10 | 3204112450123 |
11 | 1025946a46592 |
12 | 438b8a939b77 |
13 | 1a31b9b53100 |
14 | b111924048b |
15 | 5852dc51d4d |
hex | 2ea03fc024b |
3204112450123 has 12 divisors (see below), whose sum is σ = 3581462595648. Its totient is φ = 2862234442080.
The previous prime is 3204112450111. The next prime is 3204112450127. The reversal of 3204112450123 is 3210542114023.
It is not a de Polignac number, because 3204112450123 - 213 = 3204112441931 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3204112450091 and 3204112450100.
It is not an unprimeable number, because it can be changed into a prime (3204112450127) 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 11 ways as a sum of consecutive naturals, for example, 305789040 + ... + 305799517.
It is an arithmetic number, because the mean of its divisors is an integer number (298455216304).
Almost surely, 23204112450123 is an apocalyptic number.
3204112450123 is a deficient number, since it is larger than the sum of its proper divisors (377350145525).
3204112450123 is a wasteful number, since it uses less digits than its factorization.
3204112450123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 611588614 (or 611588601 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 3204112450123 its reverse (3210542114023), we get a palindrome (6414654564146).
The spelling of 3204112450123 in words is "three trillion, two hundred four billion, one hundred twelve million, four hundred fifty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •