Base | Representation |
---|---|
bin | 10111011110010010111001… |
… | …000111100100101100101100 |
3 | 111112112100120211102112010221 |
4 | 113132102321013210230230 |
5 | 102012413223030300230 |
6 | 1003322221222141124 |
7 | 30513423414452650 |
oct | 2736227107445454 |
9 | 445470524375127 |
10 | 103236939696940 |
11 | 2a9925a4094105 |
12 | b6b40162817a4 |
13 | 457b28100b14a |
14 | 1b6c9a1b74a60 |
15 | be066a46827a |
hex | 5de4b91e4b2c |
103236939696940 has 48 divisors (see below), whose sum is σ = 247799402323200. Its totient is φ = 35391129746112.
The previous prime is 103236939696887. The next prime is 103236939696971. The reversal of 103236939696940 is 49696939632301.
It is a Harshad number since it is a multiple of its sum of digits (70).
It is a self number, because there is not a number n which added to its sum of digits gives 103236939696940.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 44622250 + ... + 46878769.
It is an arithmetic number, because the mean of its divisors is an integer number (5162487548400).
Almost surely, 2103236939696940 is an apocalyptic number.
103236939696940 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103236939696940 is an abundant number, since it is smaller than the sum of its proper divisors (144562462626260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103236939696940 is a wasteful number, since it uses less digits than its factorization.
103236939696940 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91509094 (or 91509092 counting only the distinct ones).
The product of its (nonzero) digits is 306110016, while the sum is 70.
The spelling of 103236939696940 in words is "one hundred three trillion, two hundred thirty-six billion, nine hundred thirty-nine million, six hundred ninety-six thousand, nine hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •