Base | Representation |
---|---|
bin | 10001111100011100010… |
… | …010001100010101100001 |
3 | 11100212220221220212020100 |
4 | 101330130102030111201 |
5 | 130200422304120441 |
6 | 2342254150333013 |
7 | 155043054201300 |
oct | 21743422142541 |
9 | 4325827825210 |
10 | 1233130145121 |
11 | 435a70901516 |
12 | 17aba495a169 |
13 | 8c38c300b84 |
14 | 43980576437 |
15 | 22123514cb6 |
hex | 11f1c48c561 |
1233130145121 has 72 divisors (see below), whose sum is σ = 2096541532800. Its totient is φ = 696307328640.
The previous prime is 1233130145053. The next prime is 1233130145129. The reversal of 1233130145121 is 1215410313321.
1233130145121 is a `hidden beast` number, since 1 + 2 + 3 + 3 + 130 + 14 + 512 + 1 = 666.
It is not a de Polignac number, because 1233130145121 - 210 = 1233130144097 is a prime.
It is a super-2 number, since 2×12331301451212 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1233130145129) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 71856340 + ... + 71873498.
It is an arithmetic number, because the mean of its divisors is an integer number (29118632400).
Almost surely, 21233130145121 is an apocalyptic number.
It is an amenable number.
1233130145121 is a deficient number, since it is larger than the sum of its proper divisors (863411387679).
1233130145121 is a wasteful number, since it uses less digits than its factorization.
1233130145121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19099 (or 19089 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
Adding to 1233130145121 its reverse (1215410313321), we get a palindrome (2448540458442).
The spelling of 1233130145121 in words is "one trillion, two hundred thirty-three billion, one hundred thirty million, one hundred forty-five thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •