Base | Representation |
---|---|
bin | 10001111001110110100… |
… | …101001111010001101011 |
3 | 11100121202012210221202120 |
4 | 101321312211033101223 |
5 | 130124224112320133 |
6 | 2341114241002323 |
7 | 154614136316022 |
oct | 21716645172153 |
9 | 4317665727676 |
10 | 1230350120043 |
11 | 434874627530 |
12 | 17a5499233a3 |
13 | 8c038378815 |
14 | 437992718b9 |
15 | 2200e423ab3 |
hex | 11e7694f46b |
1230350120043 has 16 divisors (see below), whose sum is σ = 1794398048256. Its totient is φ = 743667625440.
The previous prime is 1230350119993. The next prime is 1230350120059. The reversal of 1230350120043 is 3400210530321.
It is not a de Polignac number, because 1230350120043 - 212 = 1230350115947 is a prime.
It is a super-2 number, since 2×12303501200432 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1230350119995 and 1230350120022.
It is not an unprimeable number, because it can be changed into a prime (1230350120093) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 49965355 + ... + 49989972.
It is an arithmetic number, because the mean of its divisors is an integer number (112149878016).
Almost surely, 21230350120043 is an apocalyptic number.
1230350120043 is a deficient number, since it is larger than the sum of its proper divisors (564047928213).
1230350120043 is a wasteful number, since it uses less digits than its factorization.
1230350120043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99955714.
The product of its (nonzero) digits is 2160, while the sum is 24.
Adding to 1230350120043 its reverse (3400210530321), we get a palindrome (4630560650364).
The spelling of 1230350120043 in words is "one trillion, two hundred thirty billion, three hundred fifty million, one hundred twenty thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •