Base | Representation |
---|---|
bin | 1001101001101… |
… | …0000001011010 |
3 | 2211011102200100 |
4 | 2122122001122 |
5 | 40330224022 |
6 | 4003320230 |
7 | 1001022024 |
oct | 232320132 |
9 | 84142610 |
10 | 40476762 |
11 | 20936877 |
12 | 11680076 |
13 | 8502861 |
14 | 5539014 |
15 | 38481ac |
hex | 269a05a |
40476762 has 72 divisors (see below), whose sum is σ = 96550272. Its totient is φ = 12240000.
The previous prime is 40476743. The next prime is 40476767. The reversal of 40476762 is 26767404.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (40476767) 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 35 ways as a sum of consecutive naturals, for example, 161137 + ... + 161387.
It is an arithmetic number, because the mean of its divisors is an integer number (1340976).
Almost surely, 240476762 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40476762, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48275136).
40476762 is an abundant number, since it is smaller than the sum of its proper divisors (56073510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40476762 is a wasteful number, since it uses less digits than its factorization.
40476762 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324 (or 304 counting only the distinct ones).
The product of its (nonzero) digits is 56448, while the sum is 36.
The square root of 40476762 is about 6362.1350190011. The cubic root of 40476762 is about 343.3485790404.
The spelling of 40476762 in words is "forty million, four hundred seventy-six thousand, seven hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •