Base | Representation |
---|---|
bin | 1011001111111010111110… |
… | …0010111111011001101000 |
3 | 1121210101101001121012220000 |
4 | 2303332233202333121220 |
5 | 3110114440420434233 |
6 | 42145504043303000 |
7 | 2414366302440342 |
oct | 263765742773150 |
9 | 47711331535800 |
10 | 12368156030568 |
11 | 3a3933a707698 |
12 | 147904651aa60 |
13 | 6b940991c560 |
14 | 30a89c896292 |
15 | 166acdd9dd13 |
hex | b3faf8bf668 |
12368156030568 has 80 divisors (see below), whose sum is σ = 37307080359780. Its totient is φ = 3805586468352.
The previous prime is 12368156030551. The next prime is 12368156030591. The reversal of 12368156030568 is 86503065186321.
It is a happy number.
12368156030568 is a `hidden beast` number, since 1 + 2 + 3 + 6 + 8 + 15 + 60 + 3 + 0 + 568 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 11471078062404 + 897077968164 = 3386898^2 + 947142^2 .
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 734093905 + ... + 734110752.
Almost surely, 212368156030568 is an apocalyptic number.
12368156030568 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
12368156030568 is an abundant number, since it is smaller than the sum of its proper divisors (24938924329212).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12368156030568 is a wasteful number, since it uses less digits than its factorization.
12368156030568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1468204688 (or 1468204675 counting only the distinct ones).
The product of its (nonzero) digits is 6220800, while the sum is 54.
The spelling of 12368156030568 in words is "twelve trillion, three hundred sixty-eight billion, one hundred fifty-six million, thirty thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •