Base | Representation |
---|---|
bin | 1111100110011101101… |
… | …1000010010011110101 |
3 | 221121210222202212011002 |
4 | 3321213123002103311 |
5 | 13342402404103244 |
6 | 323043401253045 |
7 | 25235601604364 |
oct | 3714733022365 |
9 | 847728685132 |
10 | 268023112949 |
11 | a3739072819 |
12 | 43b40494185 |
13 | 1c375022777 |
14 | cd883377db |
15 | 6e8a23aa4e |
hex | 3e676c24f5 |
268023112949 has 4 divisors (see below), whose sum is σ = 268244073036. Its totient is φ = 267802152864.
The previous prime is 268023112937. The next prime is 268023112957. The reversal of 268023112949 is 949211320862.
It is a happy number.
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 4769974225 + 263253138724 = 69065^2 + 513082^2 .
It is a cyclic number.
It is not a de Polignac number, because 268023112949 - 24 = 268023112933 is a prime.
It is a super-2 number, since 2×2680231129492 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (268023115949) 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, 110478224 + ... + 110480649.
It is an arithmetic number, because the mean of its divisors is an integer number (67061018259).
Almost surely, 2268023112949 is an apocalyptic number.
It is an amenable number.
268023112949 is a deficient number, since it is larger than the sum of its proper divisors (220960087).
268023112949 is a wasteful number, since it uses less digits than its factorization.
268023112949 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220960086.
The product of its (nonzero) digits is 373248, while the sum is 47.
The spelling of 268023112949 in words is "two hundred sixty-eight billion, twenty-three million, one hundred twelve thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •