Base | Representation |
---|---|
bin | 101011000100000100… |
… | …111000001100101001 |
3 | 11102100111101002221021 |
4 | 223010010320030221 |
5 | 1224144224123212 |
6 | 33124140212441 |
7 | 3224565306106 |
oct | 530404701451 |
9 | 142314332837 |
10 | 46239286057 |
11 | 18678964aa8 |
12 | 8b6553a121 |
13 | 448b8ac1c3 |
14 | 23490a7aad |
15 | 1309639307 |
hex | ac4138329 |
46239286057 has 8 divisors (see below), whose sum is σ = 46432603656. Its totient is φ = 46046072832.
The previous prime is 46239286039. The next prime is 46239286061. The reversal of 46239286057 is 75068293264.
It can be written as a sum of positive squares in 4 ways, for example, as 29042635561 + 17196650496 = 170419^2 + 131136^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-46239286057 is a prime.
It is a super-2 number, since 2×462392860572 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 46239285995 and 46239286013.
It is not an unprimeable number, because it can be changed into a prime (46239286097) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 935283 + ... + 983479.
It is an arithmetic number, because the mean of its divisors is an integer number (5804075457).
Almost surely, 246239286057 is an apocalyptic number.
It is an amenable number.
46239286057 is a deficient number, since it is larger than the sum of its proper divisors (193317599).
46239286057 is a wasteful number, since it uses less digits than its factorization.
46239286057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52187.
The product of its (nonzero) digits is 4354560, while the sum is 52.
The spelling of 46239286057 in words is "forty-six billion, two hundred thirty-nine million, two hundred eighty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •