Base | Representation |
---|---|
bin | 1011010011110100100100… |
… | …0101111011100001111011 |
3 | 1122000210022110000110201001 |
4 | 2310331021011323201323 |
5 | 3112214200043110433 |
6 | 42240344310305431 |
7 | 2422260526132150 |
oct | 264751105734173 |
9 | 48023273013631 |
10 | 12435156613243 |
11 | 3a647a17a7071 |
12 | 148a024958277 |
13 | 6c2826827950 |
14 | 30dc16db8227 |
15 | 168700ed357d |
hex | b4f4917b87b |
12435156613243 has 32 divisors (see below), whose sum is σ = 16276479496704. Its totient is φ = 9219258542592.
The previous prime is 12435156613193. The next prime is 12435156613249. The reversal of 12435156613243 is 34231665153421.
It is a happy number.
It is not a de Polignac number, because 12435156613243 - 221 = 12435154516091 is a prime.
It is a super-2 number, since 2×124351566132432 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12435156613193 and 12435156613202.
It is not an unprimeable number, because it can be changed into a prime (12435156613249) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17354205 + ... + 18056542.
It is an arithmetic number, because the mean of its divisors is an integer number (508639984272).
Almost surely, 212435156613243 is an apocalyptic number.
12435156613243 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
12435156613243 is a deficient number, since it is larger than the sum of its proper divisors (3841322883461).
12435156613243 is a wasteful number, since it uses less digits than its factorization.
12435156613243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35411011.
The product of its digits is 1555200, while the sum is 46.
The spelling of 12435156613243 in words is "twelve trillion, four hundred thirty-five billion, one hundred fifty-six million, six hundred thirteen thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •