Base | Representation |
---|---|
bin | 1111011001000001… |
… | …1010010011110111 |
3 | 101122221010210201002 |
4 | 3312100122103313 |
5 | 31430130402312 |
6 | 1521544153515 |
7 | 204245101235 |
oct | 36620322367 |
9 | 11587123632 |
10 | 4131497207 |
11 | 1830139002 |
12 | 97376889b |
13 | 50ac42806 |
14 | 2b29c3955 |
15 | 192a9c4c2 |
hex | f641a4f7 |
4131497207 has 4 divisors (see below), whose sum is σ = 4183794720. Its totient is φ = 4079199696.
The previous prime is 4131497203. The next prime is 4131497221. The reversal of 4131497207 is 7027941314.
It is a happy number.
4131497207 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7027941314 = 2 ⋅3513970657.
It is a cyclic number.
It is not a de Polignac number, because 4131497207 - 22 = 4131497203 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4131497203) 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, 26148638 + ... + 26148795.
It is an arithmetic number, because the mean of its divisors is an integer number (1045948680).
Almost surely, 24131497207 is an apocalyptic number.
4131497207 is a deficient number, since it is larger than the sum of its proper divisors (52297513).
4131497207 is an equidigital number, since it uses as much as digits as its factorization.
4131497207 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52297512.
The product of its (nonzero) digits is 42336, while the sum is 38.
The square root of 4131497207 is about 64276.7236797272. The cubic root of 4131497207 is about 1604.6087440888.
The spelling of 4131497207 in words is "four billion, one hundred thirty-one million, four hundred ninety-seven thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •