Base | Representation |
---|---|
bin | 10101000110100100001010… |
… | …10110110000101001010100 |
3 | 20002022021120200211220012001 |
4 | 22203102011112300221110 |
5 | 22040300032341032012 |
6 | 242410105254405044 |
7 | 12526440513546433 |
oct | 1243220526605124 |
9 | 202267520756161 |
10 | 46405064002132 |
11 | 13871305940650 |
12 | 5255742060784 |
13 | 1cb7c95442c54 |
14 | b66034c2d11a |
15 | 55717ee48357 |
hex | 2a34855b0a54 |
46405064002132 has 24 divisors (see below), whose sum is σ = 88592462425152. Its totient is φ = 21092978385600.
The previous prime is 46405064002109. The next prime is 46405064002151. The reversal of 46405064002132 is 23120046050464.
It is a junction number, because it is equal to n+sod(n) for n = 46405064002091 and 46405064002100.
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 7 ways as a sum of consecutive naturals, for example, 1744344 + ... + 9790447.
It is an arithmetic number, because the mean of its divisors is an integer number (3691352601048).
Almost surely, 246405064002132 is an apocalyptic number.
It is an amenable number.
46405064002132 is a deficient number, since it is larger than the sum of its proper divisors (42187398423020).
46405064002132 is a wasteful number, since it uses less digits than its factorization.
46405064002132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11626239 (or 11626237 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 37.
The spelling of 46405064002132 in words is "forty-six trillion, four hundred five billion, sixty-four million, two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.249 sec. • engine limits •