Base | Representation |
---|---|
bin | 11100000101101000010001… |
… | …100100001000100011100111 |
3 | 121012101120001111222002001101 |
4 | 130011220101210020203213 |
5 | 112142422312334134310 |
6 | 1114421514502140531 |
7 | 35006621455230355 |
oct | 3405502144104347 |
9 | 535346044862041 |
10 | 123532144052455 |
11 | 363a7762928796 |
12 | 11a31435121747 |
13 | 53c1053712808 |
14 | 2270db826a7d5 |
15 | e4354b97143a |
hex | 705a119088e7 |
123532144052455 has 16 divisors (see below), whose sum is σ = 148286296819584. Its totient is φ = 98793903843360.
The previous prime is 123532144052441. The next prime is 123532144052519. The reversal of 123532144052455 is 554250441235321.
It is a de Polignac number, because none of the positive numbers 2k-123532144052455 is a prime.
It is a super-2 number, since 2×1235321440524552 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
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, 221354920 + ... + 221912290.
It is an arithmetic number, because the mean of its divisors is an integer number (9267893551224).
Almost surely, 2123532144052455 is an apocalyptic number.
123532144052455 is a deficient number, since it is larger than the sum of its proper divisors (24754152767129).
123532144052455 is an equidigital number, since it uses as much as digits as its factorization.
123532144052455 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571566.
The product of its (nonzero) digits is 2880000, while the sum is 46.
Adding to 123532144052455 its reverse (554250441235321), we get a palindrome (677782585287776).
The spelling of 123532144052455 in words is "one hundred twenty-three trillion, five hundred thirty-two billion, one hundred forty-four million, fifty-two thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •