Base | Representation |
---|---|
bin | 101010111100101011… |
… | …010100101000010101 |
3 | 11102000211210011011001 |
4 | 222330223110220111 |
5 | 1223420434140021 |
6 | 33103543343301 |
7 | 3221530163362 |
oct | 527453245025 |
9 | 142024704131 |
10 | 46115146261 |
11 | 18614885a28 |
12 | 8b2ba51b31 |
13 | 446bc65bc2 |
14 | 23367d1469 |
15 | 12ed7b7091 |
hex | abcad4a15 |
46115146261 has 2 divisors, whose sum is σ = 46115146262. Its totient is φ = 46115146260.
The previous prime is 46115146219. The next prime is 46115146327. The reversal of 46115146261 is 16264151164.
46115146261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23522050161 + 22593096100 = 153369^2 + 150310^2 .
It is a cyclic number.
It is not a de Polignac number, because 46115146261 - 29 = 46115145749 is a prime.
It is a super-3 number, since 3×461151462613 (a number of 33 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 46115146261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (46115146201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23057573130 + 23057573131.
It is an arithmetic number, because the mean of its divisors is an integer number (23057573131).
Almost surely, 246115146261 is an apocalyptic number.
It is an amenable number.
46115146261 is a deficient number, since it is larger than the sum of its proper divisors (1).
46115146261 is an equidigital number, since it uses as much as digits as its factorization.
46115146261 is an evil number, because the sum of its binary digits is even.
The product of its digits is 34560, while the sum is 37.
The spelling of 46115146261 in words is "forty-six billion, one hundred fifteen million, one hundred forty-six thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •