Base | Representation |
---|---|
bin | 100101011001100110… |
… | …011001110110100010 |
3 | 10211122200020222122120 |
4 | 211121212121312202 |
5 | 1124220413222000 |
6 | 30240500045110 |
7 | 2621102621403 |
oct | 453146316642 |
9 | 124580228576 |
10 | 40157945250 |
11 | 16038127705 |
12 | 7948993796 |
13 | 3a2ca039a7 |
14 | 1d2d5639aa |
15 | 10a07d56a0 |
hex | 959999da2 |
40157945250 has 64 divisors (see below), whose sum is σ = 100308499200. Its totient is φ = 10700851200.
The previous prime is 40157945213. The next prime is 40157945263. The reversal of 40157945250 is 5254975104.
40157945250 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-3 number, since 3×401579452503 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1030114 + ... + 1068386.
It is an arithmetic number, because the mean of its divisors is an integer number (1567320300).
Almost surely, 240157945250 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40157945250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50154249600).
40157945250 is an abundant number, since it is smaller than the sum of its proper divisors (60150553950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40157945250 is a wasteful number, since it uses less digits than its factorization.
40157945250 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39692 (or 39682 counting only the distinct ones).
The product of its (nonzero) digits is 252000, while the sum is 42.
The spelling of 40157945250 in words is "forty billion, one hundred fifty-seven million, nine hundred forty-five thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •