Base | Representation |
---|---|
bin | 10111101101111101111111… |
… | …101110000100011100110000 |
3 | 111200100022200221210212202010 |
4 | 113231331333232010130300 |
5 | 102133040044424014412 |
6 | 1005505110215522520 |
7 | 30654303332650533 |
oct | 2755757756043460 |
9 | 450308627725663 |
10 | 104314013501232 |
11 | 30268363184a17 |
12 | b848908089440 |
13 | 4628a000c8532 |
14 | 1ba8b7a482a1a |
15 | c0d6a833733c |
hex | 5edf7fb84730 |
104314013501232 has 40 divisors (see below), whose sum is σ = 269526802591296. Its totient is φ = 34765023720256.
The previous prime is 104314013501207. The next prime is 104314013501263. The reversal of 104314013501232 is 232105310413401.
It is a self number, because there is not a number n which added to its sum of digits gives 104314013501232.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 197048958 + ... + 197577629.
Almost surely, 2104314013501232 is an apocalyptic number.
104314013501232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
104314013501232 is an abundant number, since it is smaller than the sum of its proper divisors (165212789090064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104314013501232 is a wasteful number, since it uses less digits than its factorization.
104314013501232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394632105 (or 394632099 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
Adding to 104314013501232 its reverse (232105310413401), we get a palindrome (336419323914633).
The spelling of 104314013501232 in words is "one hundred four trillion, three hundred fourteen billion, thirteen million, five hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •