Base | Representation |
---|---|
bin | 1101011011111100111… |
… | …01000111111010000001 |
3 | 1122010200111010201010101 |
4 | 12231332131013322001 |
5 | 30031011331030244 |
6 | 552032210202401 |
7 | 45232636204105 |
oct | 6557635077201 |
9 | 1563614121111 |
10 | 461683064449 |
11 | 168887065712 |
12 | 75588883401 |
13 | 346c8995449 |
14 | 184ba3ad905 |
15 | c021ca70d4 |
hex | 6b7e747e81 |
461683064449 has 4 divisors (see below), whose sum is σ = 476576066560. Its totient is φ = 446790062340.
The previous prime is 461683064441. The next prime is 461683064477. The reversal of 461683064449 is 944460386164.
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 461683064449 - 23 = 461683064441 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 461683064449.
It is not an unprimeable number, because it can be changed into a prime (461683064441) 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 3 ways as a sum of consecutive naturals, for example, 7446501009 + ... + 7446501070.
It is an arithmetic number, because the mean of its divisors is an integer number (119144016640).
Almost surely, 2461683064449 is an apocalyptic number.
It is an amenable number.
461683064449 is a deficient number, since it is larger than the sum of its proper divisors (14893002111).
461683064449 is a wasteful number, since it uses less digits than its factorization.
461683064449 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14893002110.
The product of its (nonzero) digits is 11943936, while the sum is 55.
The spelling of 461683064449 in words is "four hundred sixty-one billion, six hundred eighty-three million, sixty-four thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •