Base | Representation |
---|---|
bin | 1110010001100100001… |
… | …1001111001101100011 |
3 | 212102222201221020202111 |
4 | 3210121003033031203 |
5 | 13004214223240021 |
6 | 304354135100151 |
7 | 23501053430344 |
oct | 3443103171543 |
9 | 772881836674 |
10 | 245233415011 |
11 | 95003962412 |
12 | 3b640211657 |
13 | 1a1826b6ac0 |
14 | bc257500cb |
15 | 65a461c8e1 |
hex | 39190cf363 |
245233415011 has 4 divisors (see below), whose sum is σ = 264097523872. Its totient is φ = 226369306152.
The previous prime is 245233414973. The next prime is 245233415041. The reversal of 245233415011 is 110514332542.
245233415011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 245233415011 - 29 = 245233414499 is a prime.
It is not an unprimeable number, because it can be changed into a prime (245233415041) 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, 9432054411 + ... + 9432054436.
It is an arithmetic number, because the mean of its divisors is an integer number (66024380968).
Almost surely, 2245233415011 is an apocalyptic number.
245233415011 is a deficient number, since it is larger than the sum of its proper divisors (18864108861).
245233415011 is a wasteful number, since it uses less digits than its factorization.
245233415011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18864108860.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 245233415011 its reverse (110514332542), we get a palindrome (355747747553).
The spelling of 245233415011 in words is "two hundred forty-five billion, two hundred thirty-three million, four hundred fifteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •