Base | Representation |
---|---|
bin | 10001111100011100010… |
… | …010100011100101001010 |
3 | 11100212220222002200211121 |
4 | 101330130102203211022 |
5 | 130200422320142310 |
6 | 2342254152345454 |
7 | 155043055046002 |
oct | 21743422434512 |
9 | 4325828080747 |
10 | 1233130240330 |
11 | 435a70966aaa |
12 | 17aba49a528a |
13 | 8c38c335301 |
14 | 4398059d002 |
15 | 221235330da |
hex | 11f1c4a394a |
1233130240330 has 16 divisors (see below), whose sum is σ = 2242517263560. Its totient is φ = 488167022592.
The previous prime is 1233130240231. The next prime is 1233130240357. The reversal of 1233130240330 is 330420313321.
It can be written as a sum of positive squares in 4 ways, for example, as 1097270915049 + 135859325281 = 1047507^2 + 368591^2 .
It is a super-2 number, since 2×12331302403302 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1233130240295 and 1233130240304.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 635633175 + ... + 635635114.
Almost surely, 21233130240330 is an apocalyptic number.
1233130240330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1233130240330 is a deficient number, since it is larger than the sum of its proper divisors (1009387023230).
1233130240330 is a wasteful number, since it uses less digits than its factorization.
1233130240330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1271268393.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 1233130240330 its reverse (330420313321), we get a palindrome (1563550553651).
The spelling of 1233130240330 in words is "one trillion, two hundred thirty-three billion, one hundred thirty million, two hundred forty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •