Base | Representation |
---|---|
bin | 100001111100110010010… |
… | …1010000111010100000001 |
3 | 121112001211011221010001212 |
4 | 1003321210222013110001 |
5 | 1102422003422320212 |
6 | 13531312543335505 |
7 | 661052256120056 |
oct | 103714452072401 |
9 | 17461734833055 |
10 | 4666023245057 |
11 | 153993852a3a9 |
12 | 6343818b1595 |
13 | 27b00902a345 |
14 | 121b9ddb702d |
15 | 81592255e22 |
hex | 43e64a87501 |
4666023245057 has 4 divisors (see below), whose sum is σ = 4666373849940. Its totient is φ = 4665672640176.
The previous prime is 4666023245003. The next prime is 4666023245069. The reversal of 4666023245057 is 7505423206664.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1568127558001 + 3097895687056 = 1252249^2 + 1760084^2 .
It is a cyclic number.
It is not a de Polignac number, because 4666023245057 - 228 = 4665754809601 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4666023244996 and 4666023245014.
It is not an unprimeable number, because it can be changed into a prime (4666023245857) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 175282478 + ... + 175309095.
It is an arithmetic number, because the mean of its divisors is an integer number (1166593462485).
Almost surely, 24666023245057 is an apocalyptic number.
It is an amenable number.
4666023245057 is a deficient number, since it is larger than the sum of its proper divisors (350604883).
4666023245057 is a wasteful number, since it uses less digits than its factorization.
4666023245057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 350604882.
The product of its (nonzero) digits is 7257600, while the sum is 50.
The spelling of 4666023245057 in words is "four trillion, six hundred sixty-six billion, twenty-three million, two hundred forty-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •