Base | Representation |
---|---|
bin | 100101010001000101… |
… | …001110110101110110 |
3 | 10211021201100020002000 |
4 | 211101011032311312 |
5 | 1123422322003140 |
6 | 30214353000130 |
7 | 2614416104625 |
oct | 452105166566 |
9 | 124251306060 |
10 | 40015031670 |
11 | 15a74495609 |
12 | 7908b53046 |
13 | 3a09216443 |
14 | 1d185a16bc |
15 | 1092ea5a30 |
hex | 95114ed76 |
40015031670 has 32 divisors (see below), whose sum is σ = 106706751840. Its totient is φ = 10670675040.
The previous prime is 40015031629. The next prime is 40015031671. The reversal of 40015031670 is 7613051004.
40015031670 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×400150316702 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40015031671) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74101641 + ... + 74102180.
It is an arithmetic number, because the mean of its divisors is an integer number (3334585995).
Almost surely, 240015031670 is an apocalyptic number.
40015031670 is an abundant number, since it is smaller than the sum of its proper divisors (66691720170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40015031670 is a wasteful number, since it uses less digits than its factorization.
40015031670 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148203837 (or 148203831 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
Adding to 40015031670 its reverse (7613051004), we get a palindrome (47628082674).
The spelling of 40015031670 in words is "forty billion, fifteen million, thirty-one thousand, six hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •