Base | Representation |
---|---|
bin | 11011110110000111011010… |
… | …00010000110110011100011 |
3 | 22000210211011011212002220021 |
4 | 31323003231002012303203 |
5 | 31011220221303233011 |
6 | 334122022121454311 |
7 | 15616640402443564 |
oct | 1573035502066343 |
9 | 260724134762807 |
10 | 61233030524131 |
11 | 18568867430924 |
12 | 6a4b456041397 |
13 | 282233333c21b |
14 | 11199a197a16b |
15 | 712c2948a471 |
hex | 37b0ed086ce3 |
61233030524131 has 4 divisors (see below), whose sum is σ = 61233056080792. Its totient is φ = 61233004967472.
The previous prime is 61233030524093. The next prime is 61233030524167. The reversal of 61233030524131 is 13142503033216.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-61233030524131 is a prime.
It is a super-2 number, since 2×612330305241312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (61233030524231) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8764005 + ... + 14116438.
It is an arithmetic number, because the mean of its divisors is an integer number (15308264020198).
Almost surely, 261233030524131 is an apocalyptic number.
61233030524131 is a deficient number, since it is larger than the sum of its proper divisors (25556661).
61233030524131 is a wasteful number, since it uses less digits than its factorization.
61233030524131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25556660.
The product of its (nonzero) digits is 38880, while the sum is 34.
Adding to 61233030524131 its reverse (13142503033216), we get a palindrome (74375533557347).
The spelling of 61233030524131 in words is "sixty-one trillion, two hundred thirty-three billion, thirty million, five hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •