Base | Representation |
---|---|
bin | 111001011111001111… |
… | …1110110100110000011 |
3 | 102210122210120011002112 |
4 | 1302332133312212003 |
5 | 4010314001333121 |
6 | 132414155205535 |
7 | 11630222040011 |
oct | 1627637664603 |
9 | 383583504075 |
10 | 123455105411 |
11 | 483a2208a40 |
12 | 1bb14a468ab |
13 | b845c65341 |
14 | 5d921798b1 |
15 | 332849575b |
hex | 1cbe7f6983 |
123455105411 has 16 divisors (see below), whose sum is σ = 135207356928. Its totient is φ = 111791772000.
The previous prime is 123455105401. The next prime is 123455105419. The reversal of 123455105411 is 114501554321.
It is a cyclic number.
It is not a de Polignac number, because 123455105411 - 234 = 106275236227 is a prime.
It is a super-2 number, since 2×1234551054112 (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 (123455105419) 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, 3425636 + ... + 3461486.
It is an arithmetic number, because the mean of its divisors is an integer number (8450459808).
Almost surely, 2123455105411 is an apocalyptic number.
123455105411 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
123455105411 is a deficient number, since it is larger than the sum of its proper divisors (11752251517).
123455105411 is a wasteful number, since it uses less digits than its factorization.
123455105411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37082.
The product of its (nonzero) digits is 12000, while the sum is 32.
Adding to 123455105411 its reverse (114501554321), we get a palindrome (237956659732).
The spelling of 123455105411 in words is "one hundred twenty-three billion, four hundred fifty-five million, one hundred five thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •