Base | Representation |
---|---|
bin | 101011011011111101… |
… | …101011101111011111 |
3 | 11110101102111012010100 |
4 | 223123331223233133 |
5 | 1231004323200330 |
6 | 33232014112143 |
7 | 3240532624350 |
oct | 533375535737 |
9 | 143342435110 |
10 | 46640053215 |
11 | 18864104328 |
12 | 90577ab653 |
13 | 452392ba32 |
14 | 23863cbd27 |
15 | 132e900060 |
hex | adbf6bbdf |
46640053215 has 48 divisors (see below), whose sum is σ = 92426458176. Its totient is φ = 21313152000.
The previous prime is 46640053153. The next prime is 46640053219. The reversal of 46640053215 is 51235004664.
46640053215 is a `hidden beast` number, since 4 + 6 + 640 + 0 + 5 + 3 + 2 + 1 + 5 = 666.
It is not a de Polignac number, because 46640053215 - 27 = 46640053087 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 46640053215.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46640053219) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 855885 + ... + 908745.
It is an arithmetic number, because the mean of its divisors is an integer number (1925551212).
Almost surely, 246640053215 is an apocalyptic number.
46640053215 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
46640053215 is a deficient number, since it is larger than the sum of its proper divisors (45786404961).
46640053215 is a wasteful number, since it uses less digits than its factorization.
46640053215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55680 (or 55677 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
Adding to 46640053215 its reverse (51235004664), we get a palindrome (97875057879).
The spelling of 46640053215 in words is "forty-six billion, six hundred forty million, fifty-three thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •