Base | Representation |
---|---|
bin | 101011100001001011… |
… | …000110111001001101 |
3 | 11110121111221211110201 |
4 | 223201023012321031 |
5 | 1231144212132011 |
6 | 33244415333501 |
7 | 3242643562042 |
oct | 534113067115 |
9 | 143544854421 |
10 | 46727458381 |
11 | 188a94830aa |
12 | 9080b21291 |
13 | 4538a82876 |
14 | 2393c611c9 |
15 | 1337417cc1 |
hex | ae12c6e4d |
46727458381 has 4 divisors (see below), whose sum is σ = 46728228672. Its totient is φ = 46726688092.
The previous prime is 46727458373. The next prime is 46727458573. The reversal of 46727458381 is 18385472764.
46727458381 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, 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 46727458381 - 23 = 46727458373 is a prime.
It is a super-2 number, since 2×467274583812 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46727458301) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 285571 + ... + 418336.
It is an arithmetic number, because the mean of its divisors is an integer number (11682057168).
Almost surely, 246727458381 is an apocalyptic number.
It is an amenable number.
46727458381 is a deficient number, since it is larger than the sum of its proper divisors (770291).
46727458381 is an equidigital number, since it uses as much as digits as its factorization.
46727458381 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 770290.
The product of its digits is 9031680, while the sum is 55.
The spelling of 46727458381 in words is "forty-six billion, seven hundred twenty-seven million, four hundred fifty-eight thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •