Base | Representation |
---|---|
bin | 1110011110001011000… |
… | …11101001000101000110 |
3 | 1202112110012200102010220 |
4 | 13033011203221011012 |
5 | 31121314314201034 |
6 | 1020232114325210 |
7 | 50631651443022 |
oct | 7170543510506 |
9 | 1675405612126 |
10 | 497235693894 |
11 | 18197064a3a5 |
12 | 8044b289806 |
13 | 37b7353a3a4 |
14 | 1a0d0051382 |
15 | ce030e9749 |
hex | 73c58e9146 |
497235693894 has 8 divisors (see below), whose sum is σ = 994471387800. Its totient is φ = 165745231296.
The previous prime is 497235693893. The next prime is 497235693907. The reversal of 497235693894 is 498396532794.
497235693894 is digitally balanced in base 7, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
497235693894 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (497235693893) 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, 41436307819 + ... + 41436307830.
It is an arithmetic number, because the mean of its divisors is an integer number (124308923475).
Almost surely, 2497235693894 is an apocalyptic number.
497235693894 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
497235693894 is a wasteful number, since it uses less digits than its factorization.
497235693894 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82872615654.
The product of its digits is 352719360, while the sum is 69.
The spelling of 497235693894 in words is "four hundred ninety-seven billion, two hundred thirty-five million, six hundred ninety-three thousand, eight hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •