Base | Representation |
---|---|
bin | 100101010110010101… |
… | …111111011010111000 |
3 | 10211111212110021121000 |
4 | 211112111333122320 |
5 | 1124112421423112 |
6 | 30231225045000 |
7 | 2616540343101 |
oct | 452625773270 |
9 | 124455407530 |
10 | 40103311032 |
11 | 1600a301164 |
12 | 7932626760 |
13 | 3a215b5155 |
14 | 1d261c13a8 |
15 | 109aae27dc |
hex | 95657f6b8 |
40103311032 has 128 divisors (see below), whose sum is σ = 118056960000. Its totient is φ = 12570121728.
The previous prime is 40103311021. The next prime is 40103311067. The reversal of 40103311032 is 23011330104.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 40103310996 and 40103311014.
It is a congruent number.
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, 4692219 + ... + 4700757.
It is an arithmetic number, because the mean of its divisors is an integer number (922320000).
Almost surely, 240103311032 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40103311032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59028480000).
40103311032 is an abundant number, since it is smaller than the sum of its proper divisors (77953648968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40103311032 is a wasteful number, since it uses less digits than its factorization.
40103311032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9850 (or 9840 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 40103311032 its reverse (23011330104), we get a palindrome (63114641136).
The spelling of 40103311032 in words is "forty billion, one hundred three million, three hundred eleven thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •