Base | Representation |
---|---|
bin | 1111001000010000… |
… | …0010000101000100 |
3 | 101111000202110101012 |
4 | 3302010002011010 |
5 | 31304123041424 |
6 | 1510552221352 |
7 | 202432102055 |
oct | 36204020504 |
9 | 11430673335 |
10 | 4061143364 |
11 | 17a4456133 |
12 | 95409a858 |
13 | 4c94abc15 |
14 | 2a750c72c |
15 | 18b801b0e |
hex | f2102144 |
4061143364 has 12 divisors (see below), whose sum is σ = 7172203500. Its totient is φ = 2011942368.
The previous prime is 4061143363. The next prime is 4061143369. The reversal of 4061143364 is 4633411604.
It can be written as a sum of positive squares in 2 ways, for example, as 2314572100 + 1746571264 = 48110^2 + 41792^2 .
It is a super-2 number, since 2×40611433642 = 32985770845922472992, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 4061143364.
It is not an unprimeable number, because it can be changed into a prime (4061143363) 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, 4656839 + ... + 4657710.
It is an arithmetic number, because the mean of its divisors is an integer number (597683625).
Almost surely, 24061143364 is an apocalyptic number.
It is an amenable number.
4061143364 is a deficient number, since it is larger than the sum of its proper divisors (3111060136).
4061143364 is a wasteful number, since it uses less digits than its factorization.
4061143364 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9314662 (or 9314660 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 32.
The square root of 4061143364 is about 63727.1007029192. The cubic root of 4061143364 is about 1595.4484398613.
Adding to 4061143364 its reverse (4633411604), we get a palindrome (8694554968).
The spelling of 4061143364 in words is "four billion, sixty-one million, one hundred forty-three thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •