Base | Representation |
---|---|
bin | 10110101111010001110110… |
… | …010011001010100000100100 |
3 | 111010002110222022111111102210 |
4 | 112233101312103022200210 |
5 | 101101444243313132312 |
6 | 552410042413203420 |
7 | 30031123663026336 |
oct | 2657216623124044 |
9 | 433073868444383 |
10 | 100006003255332 |
11 | 29957342760819 |
12 | b271a00190570 |
13 | 43a56aaab1635 |
14 | 1a9a46022b456 |
15 | b865bb84be3c |
hex | 5af4764ca824 |
100006003255332 has 12 divisors (see below), whose sum is σ = 233347340929136. Its totient is φ = 33335334418440.
The previous prime is 100006003255321. The next prime is 100006003255351. The reversal of 100006003255332 is 233552300600001.
It is a tau number, because it is divible by the number of its divisors (12).
It is a self number, because there is not a number n which added to its sum of digits gives 100006003255332.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4166916802294 + ... + 4166916802317.
Almost surely, 2100006003255332 is an apocalyptic number.
100006003255332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100006003255332 is an abundant number, since it is smaller than the sum of its proper divisors (133341337673804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100006003255332 is a wasteful number, since it uses less digits than its factorization.
100006003255332 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8333833604618 (or 8333833604616 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 30.
Adding to 100006003255332 its reverse (233552300600001), we get a palindrome (333558303855333).
The spelling of 100006003255332 in words is "one hundred trillion, six billion, three million, two hundred fifty-five thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •