Base | Representation |
---|---|
bin | 10110000100010111… |
… | …10000001100001100 |
3 | 1010120200201100222120 |
4 | 23002023300030030 |
5 | 143231013423333 |
6 | 5235351212540 |
7 | 566412412515 |
oct | 130213601414 |
9 | 33520640876 |
10 | 11847795468 |
11 | 502a854103 |
12 | 2367977150 |
13 | 116a773382 |
14 | 80571ba0c |
15 | 495207db3 |
hex | 2c22f030c |
11847795468 has 12 divisors (see below), whose sum is σ = 27644856120. Its totient is φ = 3949265152.
The previous prime is 11847795383. The next prime is 11847795469. The reversal of 11847795468 is 86459774811.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×118477954682 (a number of 21 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (11847795469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 493658133 + ... + 493658156.
It is an arithmetic number, because the mean of its divisors is an integer number (2303738010).
Almost surely, 211847795468 is an apocalyptic number.
It is an amenable number.
11847795468 is an abundant number, since it is smaller than the sum of its proper divisors (15797060652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11847795468 is a wasteful number, since it uses less digits than its factorization.
11847795468 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 987316296 (or 987316294 counting only the distinct ones).
The product of its digits is 13547520, while the sum is 60.
The spelling of 11847795468 in words is "eleven billion, eight hundred forty-seven million, seven hundred ninety-five thousand, four hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •