Base | Representation |
---|---|
bin | 1011001000000001010000… |
… | …1010010011001101001001 |
3 | 1121022101222100021121022220 |
4 | 2302000110022103031021 |
5 | 3100403431201302213 |
6 | 42003253410004253 |
7 | 2401522254545514 |
oct | 262002412231511 |
9 | 47271870247286 |
10 | 12232405103433 |
11 | 3996808867919 |
12 | 145687b876689 |
13 | 6a9684458678 |
14 | 3040a16d5d7b |
15 | 1632d6201e23 |
hex | b2014293349 |
12232405103433 has 16 divisors (see below), whose sum is σ = 16786449570816. Its totient is φ = 7920077291280.
The previous prime is 12232405103431. The next prime is 12232405103441. The reversal of 12232405103433 is 33430150423221.
It is not a de Polignac number, because 12232405103433 - 21 = 12232405103431 is a prime.
It is a super-2 number, since 2×122324051034332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12232405103394 and 12232405103403.
It is not an unprimeable number, because it can be changed into a prime (12232405103431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 428561341 + ... + 428589882.
It is an arithmetic number, because the mean of its divisors is an integer number (1049153098176).
Almost surely, 212232405103433 is an apocalyptic number.
It is an amenable number.
12232405103433 is a deficient number, since it is larger than the sum of its proper divisors (4554044467383).
12232405103433 is an equidigital number, since it uses as much as digits as its factorization.
12232405103433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 857151364.
The product of its (nonzero) digits is 51840, while the sum is 33.
Adding to 12232405103433 its reverse (33430150423221), we get a palindrome (45662555526654).
The spelling of 12232405103433 in words is "twelve trillion, two hundred thirty-two billion, four hundred five million, one hundred three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •