Base | Representation |
---|---|
bin | 1011000000011100101000… |
… | …0001011000010011000100 |
3 | 1120211222011221121000020021 |
4 | 2300013022001120103010 |
5 | 3041241013412412012 |
6 | 41423420412144524 |
7 | 2356235402436403 |
oct | 260071201302304 |
9 | 46758157530207 |
10 | 12102312232132 |
11 | 394661a826151 |
12 | 1435613a68144 |
13 | 69a321268005 |
14 | 2dba7db7363a |
15 | 15ec20146007 |
hex | b01ca0584c4 |
12102312232132 has 12 divisors (see below), whose sum is σ = 21199236162300. Its totient is φ = 6045387614336.
The previous prime is 12102312232123. The next prime is 12102312232237. The reversal of 12102312232132 is 23123221320121.
It can be written as a sum of positive squares in 2 ways, for example, as 11231774715456 + 870537516676 = 3351384^2 + 933026^2 .
It is a super-2 number, since 2×121023122321322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12102312232097 and 12102312232106.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1442120713 + ... + 1442129104.
It is an arithmetic number, because the mean of its divisors is an integer number (1766603013525).
Almost surely, 212102312232132 is an apocalyptic number.
It is an amenable number.
12102312232132 is a deficient number, since it is larger than the sum of its proper divisors (9096923930168).
12102312232132 is a wasteful number, since it uses less digits than its factorization.
12102312232132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2884250870 (or 2884250868 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 12102312232132 its reverse (23123221320121), we get a palindrome (35225533552253).
The spelling of 12102312232132 in words is "twelve trillion, one hundred two billion, three hundred twelve million, two hundred thirty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •