Base | Representation |
---|---|
bin | 101011011011100100… |
… | …010011011011000101 |
3 | 11110100221222011122011 |
4 | 223123210103123011 |
5 | 1231001122300010 |
6 | 33231215334221 |
7 | 3240422234263 |
oct | 533344233305 |
9 | 143327864564 |
10 | 46633400005 |
11 | 1886037a705 |
12 | 9055521371 |
13 | 452243c61a |
14 | 2385579433 |
15 | 132e038a8a |
hex | adb9136c5 |
46633400005 has 4 divisors (see below), whose sum is σ = 55960080012. Its totient is φ = 37306720000.
The previous prime is 46633399999. The next prime is 46633400053. The reversal of 46633400005 is 50000433664.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7905521569 + 38727878436 = 88913^2 + 196794^2 .
It is not a de Polignac number, because 46633400005 - 219 = 46632875717 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 46633400005.
It is a congruent number.
It is an unprimeable number.
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, 4663339996 + ... + 4663340005.
It is an arithmetic number, because the mean of its divisors is an integer number (13990020003).
Almost surely, 246633400005 is an apocalyptic number.
It is an amenable number.
46633400005 is a deficient number, since it is larger than the sum of its proper divisors (9326680007).
46633400005 is an equidigital number, since it uses as much as digits as its factorization.
46633400005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9326680006.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 46633400005 its reverse (50000433664), we get a palindrome (96633833669).
The spelling of 46633400005 in words is "forty-six billion, six hundred thirty-three million, four hundred thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •