Base | Representation |
---|---|
bin | 1001100100010… |
… | …1101000001011 |
3 | 2210111212111102 |
4 | 2121011220023 |
5 | 40233143313 |
6 | 3552052015 |
7 | 665052146 |
oct | 231055013 |
9 | 83455442 |
10 | 40131083 |
11 | 20720093 |
12 | 1153400b |
13 | 8411405 |
14 | 548905d |
15 | 37caa58 |
hex | 2645a0b |
40131083 has 8 divisors (see below), whose sum is σ = 41192448. Its totient is φ = 39075624.
The previous prime is 40131071. The next prime is 40131109. The reversal of 40131083 is 38013104.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40131083 - 210 = 40130059 is a prime.
It is a super-2 number, since 2×401310832 = 3221007645505778, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40131023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14510 + ... + 17052.
It is an arithmetic number, because the mean of its divisors is an integer number (5149056).
Almost surely, 240131083 is an apocalyptic number.
40131083 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
40131083 is a deficient number, since it is larger than the sum of its proper divisors (1061365).
40131083 is a wasteful number, since it uses less digits than its factorization.
40131083 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2953.
The product of its (nonzero) digits is 288, while the sum is 20.
The square root of 40131083 is about 6334.9098651836. The cubic root of 40131083 is about 342.3683632871.
Adding to 40131083 its reverse (38013104), we get a palindrome (78144187).
The spelling of 40131083 in words is "forty million, one hundred thirty-one thousand, eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •