Base | Representation |
---|---|
bin | 101011010101001111… |
… | …000001001110011010 |
3 | 11110002120001110211110 |
4 | 223111033001032122 |
5 | 1230241423012041 |
6 | 33212502241150 |
7 | 3234662211321 |
oct | 532517011632 |
9 | 143076043743 |
10 | 46527157146 |
11 | 18806404898 |
12 | 9025a261b6 |
13 | 4506421422 |
14 | 23754010b8 |
15 | 1324a4e516 |
hex | ad53c139a |
46527157146 has 16 divisors (see below), whose sum is σ = 93084751008. Its totient is φ = 15503979600.
The previous prime is 46527157123. The next prime is 46527157153. The reversal of 46527157146 is 64175172564.
46527157146 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 46527157095 and 46527157104.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1248300 + ... + 1285031.
It is an arithmetic number, because the mean of its divisors is an integer number (5817796938).
Almost surely, 246527157146 is an apocalyptic number.
46527157146 is an abundant number, since it is smaller than the sum of its proper divisors (46557593862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46527157146 is a wasteful number, since it uses less digits than its factorization.
46527157146 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2536397.
The product of its digits is 1411200, while the sum is 48.
The spelling of 46527157146 in words is "forty-six billion, five hundred twenty-seven million, one hundred fifty-seven thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •