Base | Representation |
---|---|
bin | 1101010101000010010… |
… | …10100011000000000001 |
3 | 1121210002202011100001001 |
4 | 12222201022203000001 |
5 | 30000410412224303 |
6 | 550215543412001 |
7 | 45041635265611 |
oct | 6524112430001 |
9 | 1553082140031 |
10 | 457970429953 |
11 | 167251406443 |
12 | 74911454001 |
13 | 34256769aba |
14 | 182472a0a41 |
15 | bda5d9731d |
hex | 6aa12a3001 |
457970429953 has 4 divisors (see below), whose sum is σ = 458682670768. Its totient is φ = 457258189140.
The previous prime is 457970429951. The next prime is 457970429999. The reversal of 457970429953 is 359924079754.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 457970429953 - 21 = 457970429951 is a prime.
It is a super-2 number, since 2×4579704299532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (457970429951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 356119443 + ... + 356120728.
It is an arithmetic number, because the mean of its divisors is an integer number (114670667692).
Almost surely, 2457970429953 is an apocalyptic number.
It is an amenable number.
457970429953 is a deficient number, since it is larger than the sum of its proper divisors (712240815).
457970429953 is an equidigital number, since it uses as much as digits as its factorization.
457970429953 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712240814.
The product of its (nonzero) digits is 85730400, while the sum is 64.
The spelling of 457970429953 in words is "four hundred fifty-seven billion, nine hundred seventy million, four hundred twenty-nine thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •