Base | Representation |
---|---|
bin | 101000110101110100000… |
… | …1101001000011010101010 |
3 | 201212121110012021221102101 |
4 | 1101223220031020122222 |
5 | 1213431133444420114 |
6 | 15534344431124014 |
7 | 1116351264440521 |
oct | 121535015103252 |
9 | 21777405257371 |
10 | 5613123045034 |
11 | 187456a69701a |
12 | 767a3b67360a |
13 | 31941374537b |
14 | 1559688654b8 |
15 | 9b0246e8d74 |
hex | 51ae83486aa |
5613123045034 has 8 divisors (see below), whose sum is σ = 8862825860640. Its totient is φ = 2658847758156.
The previous prime is 5613123045017. The next prime is 5613123045037. The reversal of 5613123045034 is 4305403213165.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×56131230450342 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5613123044984 and 5613123045002.
It is not an unprimeable number, because it can be changed into a prime (5613123045037) 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 3 ways as a sum of consecutive naturals, for example, 73856882134 + ... + 73856882209.
It is an arithmetic number, because the mean of its divisors is an integer number (1107853232580).
Almost surely, 25613123045034 is an apocalyptic number.
5613123045034 is a deficient number, since it is larger than the sum of its proper divisors (3249702815606).
5613123045034 is a wasteful number, since it uses less digits than its factorization.
5613123045034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147713764364.
The product of its (nonzero) digits is 129600, while the sum is 37.
Adding to 5613123045034 its reverse (4305403213165), we get a palindrome (9918526258199).
The spelling of 5613123045034 in words is "five trillion, six hundred thirteen billion, one hundred twenty-three million, forty-five thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •