Base | Representation |
---|---|
bin | 1101011010110011001… |
… | …01011111110010010101 |
3 | 1122002002101012111112122 |
4 | 12231121211133302111 |
5 | 30023230003034141 |
6 | 551450552225325 |
7 | 45211415415215 |
oct | 6553145376225 |
9 | 1562071174478 |
10 | 461064502421 |
11 | 168599989926 |
12 | 7543569b245 |
13 | 3462a79ab03 |
14 | 1845c194245 |
15 | bed781e64b |
hex | 6b5995fc95 |
461064502421 has 16 divisors (see below), whose sum is σ = 492079983360. Its totient is φ = 430755978240.
The previous prime is 461064502417. The next prime is 461064502441. The reversal of 461064502421 is 124205460164.
It is a cyclic number.
It is not a de Polignac number, because 461064502421 - 22 = 461064502417 is a prime.
It is a super-3 number, since 3×4610645024213 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (461064502411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 72740 + ... + 963026.
It is an arithmetic number, because the mean of its divisors is an integer number (30754998960).
Almost surely, 2461064502421 is an apocalyptic number.
It is an amenable number.
461064502421 is a deficient number, since it is larger than the sum of its proper divisors (31015480939).
461064502421 is a wasteful number, since it uses less digits than its factorization.
461064502421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890684.
The product of its (nonzero) digits is 46080, while the sum is 35.
Adding to 461064502421 its reverse (124205460164), we get a palindrome (585269962585).
The spelling of 461064502421 in words is "four hundred sixty-one billion, sixty-four million, five hundred two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •