Base | Representation |
---|---|
bin | 111001011111100011… |
… | …0001000100010001001 |
3 | 102210200111102222110100 |
4 | 1302333012020202021 |
5 | 4010324033442421 |
6 | 132415154240013 |
7 | 11630403243303 |
oct | 1627706104211 |
9 | 383614388410 |
10 | 123465140361 |
11 | 483a7942392 |
12 | 1bb18286009 |
13 | b848069a94 |
14 | 5d9362c973 |
15 | 33292c8c26 |
hex | 1cbf188889 |
123465140361 has 6 divisors (see below), whose sum is σ = 178338536090. Its totient is φ = 82310093568.
The previous prime is 123465140327. The next prime is 123465140371. The reversal of 123465140361 is 163041564321.
123465140361 is a `hidden beast` number, since 1 + 23 + 465 + 140 + 36 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 75635450361 + 47829690000 = 275019^2 + 218700^2 .
It is not a de Polignac number, because 123465140361 - 222 = 123460946057 is a prime.
It is a super-2 number, since 2×1234651403612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (123465140371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 6859174456 + ... + 6859174473.
Almost surely, 2123465140361 is an apocalyptic number.
It is an amenable number.
123465140361 is a deficient number, since it is larger than the sum of its proper divisors (54873395729).
123465140361 is a wasteful number, since it uses less digits than its factorization.
123465140361 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13718348935 (or 13718348932 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 123465140361 in words is "one hundred twenty-three billion, four hundred sixty-five million, one hundred forty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •