Base | Representation |
---|---|
bin | 10110101101111011001111… |
… | …100010101101011100111100 |
3 | 111002202120221112120202122102 |
4 | 112231323033202231130330 |
5 | 101043433321333103312 |
6 | 552255223111204232 |
7 | 30021322362551450 |
oct | 2655731742553474 |
9 | 432676845522572 |
10 | 99913011222332 |
11 | 29920963120a90 |
12 | b257989376678 |
13 | 43999ab137239 |
14 | 1a95b5bbdc660 |
15 | b83e779a1ec2 |
hex | 5adecf8ad73c |
99913011222332 has 48 divisors (see below), whose sum is σ = 218373797241600. Its totient is φ = 38858973523200.
The previous prime is 99913011222331. The next prime is 99913011222337. The reversal of 99913011222332 is 23322211031999.
It is a super-3 number, since 3×999130112223323 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (99913011222331) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 283880957 + ... + 284232692.
It is an arithmetic number, because the mean of its divisors is an integer number (4549454109200).
Almost surely, 299913011222332 is an apocalyptic number.
It is an amenable number.
99913011222332 is an abundant number, since it is smaller than the sum of its proper divisors (118460786019268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
99913011222332 is a wasteful number, since it uses less digits than its factorization.
99913011222332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 568114242 (or 568114240 counting only the distinct ones).
The product of its (nonzero) digits is 314928, while the sum is 47.
The spelling of 99913011222332 in words is "ninety-nine trillion, nine hundred thirteen billion, eleven million, two hundred twenty-two thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •