Base | Representation |
---|---|
bin | 11100000010011100011010… |
… | …100110000010101000110001 |
3 | 121011121122001120100122000020 |
4 | 130002130122212002220301 |
5 | 112130331020031342340 |
6 | 1114133154230314053 |
7 | 34655042226301143 |
oct | 3402343246025061 |
9 | 534548046318006 |
10 | 123313252215345 |
11 | 36322947118775 |
12 | 119b6b267b8929 |
13 | 53a650b496cca |
14 | 2264571128c93 |
15 | e3c9d9bca9d0 |
hex | 70271a982a31 |
123313252215345 has 16 divisors (see below), whose sum is σ = 198807319605312. Its totient is φ = 65265029161280.
The previous prime is 123313252215331. The next prime is 123313252215379. The reversal of 123313252215345 is 543512252313321.
It is not a de Polignac number, because 123313252215345 - 218 = 123313251953201 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 123313252215297 and 123313252215306.
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 15 ways as a sum of consecutive naturals, for example, 31377415902 + ... + 31377419831.
It is an arithmetic number, because the mean of its divisors is an integer number (12425457475332).
Almost surely, 2123313252215345 is an apocalyptic number.
123313252215345 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
123313252215345 is a deficient number, since it is larger than the sum of its proper divisors (75494067389967).
123313252215345 is a wasteful number, since it uses less digits than its factorization.
123313252215345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62754835872.
The product of its digits is 648000, while the sum is 42.
The spelling of 123313252215345 in words is "one hundred twenty-three trillion, three hundred thirteen billion, two hundred fifty-two million, two hundred fifteen thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •