Base | Representation |
---|---|
bin | 1111010010101111… |
… | …0000001000110000 |
3 | 101121002111012100111 |
4 | 3310223300020300 |
5 | 31401402010224 |
6 | 1515202431104 |
7 | 203504600626 |
oct | 36453601060 |
9 | 11532435314 |
10 | 4105110064 |
11 | 1817255a50 |
12 | 966962494 |
13 | 505634113 |
14 | 2ad2b5516 |
15 | 1905d8d94 |
hex | f4af0230 |
4105110064 has 40 divisors (see below), whose sum is σ = 8685069120. Its totient is φ = 1864161600.
The previous prime is 4105110017. The next prime is 4105110067. The reversal of 4105110064 is 4600115014.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is not an unprimeable number, because it can be changed into a prime (4105110067) 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, 181327 + ... + 202705.
It is an arithmetic number, because the mean of its divisors is an integer number (217126728).
Almost surely, 24105110064 is an apocalyptic number.
4105110064 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
4105110064 is an abundant number, since it is smaller than the sum of its proper divisors (4579959056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4105110064 is a wasteful number, since it uses less digits than its factorization.
4105110064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22489 (or 22483 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 22.
The square root of 4105110064 is about 64071.1328446751. The cubic root of 4105110064 is about 1601.1853279067.
Adding to 4105110064 its reverse (4600115014), we get a palindrome (8705225078).
It can be divided in two parts, 41051 and 10064, that added together give a palindrome (51115).
The spelling of 4105110064 in words is "four billion, one hundred five million, one hundred ten thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •