Base | Representation |
---|---|
bin | 111101111001011110010… |
… | …100000100100100111001 |
3 | 120001122021200201121102111 |
4 | 331321132110010210321 |
5 | 1024142333041133334 |
6 | 13014024332532321 |
7 | 616212112646326 |
oct | 75713624044471 |
9 | 16048250647374 |
10 | 4253599942969 |
11 | 139aa3a3052a3 |
12 | 5884620210a1 |
13 | 24b1609477a0 |
14 | 109c37cc7b4d |
15 | 759a4d74064 |
hex | 3de5e504939 |
4253599942969 has 8 divisors (see below), whose sum is σ = 4591428250752. Its totient is φ = 3917289965520.
The previous prime is 4253599942957. The next prime is 4253599942973. The reversal of 4253599942969 is 9692499953524.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4253599942969 - 27 = 4253599942841 is a prime.
It is a super-2 number, since 2×42535999429692 (a number of 26 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 = 4253599942895 and 4253599942904.
It is not an unprimeable number, because it can be changed into a prime (4253599942369) 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, 379576759 + ... + 379587964.
It is an arithmetic number, because the mean of its divisors is an integer number (573928531344).
Almost surely, 24253599942969 is an apocalyptic number.
It is an amenable number.
4253599942969 is a deficient number, since it is larger than the sum of its proper divisors (337828307783).
4253599942969 is a wasteful number, since it uses less digits than its factorization.
4253599942969 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 759165167.
The product of its digits is 1700611200, while the sum is 76.
The spelling of 4253599942969 in words is "four trillion, two hundred fifty-three billion, five hundred ninety-nine million, nine hundred forty-two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •