Base | Representation |
---|---|
bin | 1011000011010110010100… |
… | …1111011000101000101010 |
3 | 1121000201211222212102012100 |
4 | 2300311211033120220222 |
5 | 3043100111204343031 |
6 | 41502343052354230 |
7 | 2362651610202042 |
oct | 260654517305052 |
9 | 47021758772170 |
10 | 12152161012266 |
11 | 39657800a3500 |
12 | 1443206175976 |
13 | 6a1c3689c812 |
14 | 30024c37c722 |
15 | 16118b5b9de6 |
hex | b0d653d8a2a |
12152161012266 has 72 divisors (see below), whose sum is σ = 28941888961440. Its totient is φ = 3682345970160.
The previous prime is 12152161012261. The next prime is 12152161012297. The reversal of 12152161012266 is 66221016125121.
12152161012266 is a `hidden beast` number, since 1 + 2 + 1 + 5 + 2 + 1 + 610 + 12 + 26 + 6 = 666.
It is a self number, because there is not a number n which added to its sum of digits gives 12152161012266.
It is not an unprimeable number, because it can be changed into a prime (12152161012261) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 77334165 + ... + 77491143.
It is an arithmetic number, because the mean of its divisors is an integer number (401970680020).
Almost surely, 212152161012266 is an apocalyptic number.
12152161012266 is an abundant number, since it is smaller than the sum of its proper divisors (16789727949174).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12152161012266 is a wasteful number, since it uses less digits than its factorization.
12152161012266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192552 (or 192538 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
Adding to 12152161012266 its reverse (66221016125121), we get a palindrome (78373177137387).
The spelling of 12152161012266 in words is "twelve trillion, one hundred fifty-two billion, one hundred sixty-one million, twelve thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •