Base | Representation |
---|---|
bin | 1111010010110000… |
… | …1001100101011101 |
3 | 101121002200111100010 |
4 | 3310230021211131 |
5 | 31401413324201 |
6 | 1515204553433 |
7 | 203505513546 |
oct | 36454114535 |
9 | 11532614303 |
10 | 4105214301 |
11 | 18173172a1 |
12 | 9669b2879 |
13 | 50566c6b6 |
14 | 2ad3014cd |
15 | 190609bd6 |
hex | f4b0995d |
4105214301 has 8 divisors (see below), whose sum is σ = 5475674464. Its totient is φ = 2735781840.
The previous prime is 4105214297. The next prime is 4105214303. The reversal of 4105214301 is 1034125014.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 4105214301 - 22 = 4105214297 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4105214303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 247555 + ... + 263616.
It is an arithmetic number, because the mean of its divisors is an integer number (684459308).
Almost surely, 24105214301 is an apocalyptic number.
It is an amenable number.
4105214301 is a deficient number, since it is larger than the sum of its proper divisors (1370460163).
4105214301 is a wasteful number, since it uses less digits than its factorization.
4105214301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 513851.
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 4105214301 is about 64071.9462869671. The cubic root of 4105214301 is about 1601.1988802305.
Adding to 4105214301 its reverse (1034125014), we get a palindrome (5139339315).
The spelling of 4105214301 in words is "four billion, one hundred five million, two hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •