Base | Representation |
---|---|
bin | 1010101110000100100… |
… | …00000010101000100000 |
3 | 1022012201122010220110010 |
4 | 11113002100002220200 |
5 | 22013320242031102 |
6 | 441113052004520 |
7 | 35416406405031 |
oct | 5270220025040 |
9 | 1265648126403 |
10 | 368331205152 |
11 | 1322323aa079 |
12 | 5b475460740 |
13 | 2896c604391 |
14 | 13b82276a88 |
15 | 98ab531d6c |
hex | 55c2402a20 |
368331205152 has 48 divisors (see below), whose sum is σ = 1008907220160. Its totient is φ = 117438934272.
The previous prime is 368331205141. The next prime is 368331205223. The reversal of 368331205152 is 251502133863.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×3683312051522 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 368331205152.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 83406127 + ... + 83410542.
It is an arithmetic number, because the mean of its divisors is an integer number (21018900420).
Almost surely, 2368331205152 is an apocalyptic number.
368331205152 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
368331205152 is an abundant number, since it is smaller than the sum of its proper divisors (640576015008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
368331205152 is a wasteful number, since it uses less digits than its factorization.
368331205152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166816705 (or 166816697 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 39.
The spelling of 368331205152 in words is "three hundred sixty-eight billion, three hundred thirty-one million, two hundred five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •