Base | Representation |
---|---|
bin | 1011101101010111… |
… | …0100101000000000 |
3 | 22010001012222201110 |
4 | 2323111310220000 |
5 | 22414110404333 |
6 | 1235514403320 |
7 | 140613366066 |
oct | 27325645000 |
9 | 8101188643 |
10 | 3143059968 |
11 | 13731a2524 |
12 | 738730540 |
13 | 3b12235c9 |
14 | 21b606036 |
15 | 135e02063 |
hex | bb574a00 |
3143059968 has 80 divisors (see below), whose sum is σ = 8488313856. Its totient is φ = 1033297920.
The previous prime is 3143059957. The next prime is 3143059987. The reversal of 3143059968 is 8699503413.
It is a Cunningham number, because it is equal to 560632-1.
It is a super-2 number, since 2×31430599682 = 19757651924888322048, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98113 + ... + 126143.
Almost surely, 23143059968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3143059968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4244156928).
3143059968 is an abundant number, since it is smaller than the sum of its proper divisors (5345253888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3143059968 is an equidigital number, since it uses as much as digits as its factorization.
3143059968 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28125 (or 28109 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 48.
The square root of 3143059968 is about 56062.9999910815. Note that the first 5 decimals coincide. The cubic root of 3143059968 is about 1464.8198698338.
The spelling of 3143059968 in words is "three billion, one hundred forty-three million, fifty-nine thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •