Base | Representation |
---|---|
bin | 11100000011110111110110… |
… | …000110110111100001110011 |
3 | 121011222000110100110211110020 |
4 | 130003313312012313201303 |
5 | 112133433044110431121 |
6 | 1114250231535134523 |
7 | 34665116066323515 |
oct | 3403676606674163 |
9 | 534860410424406 |
10 | 123411424311411 |
11 | 36360544770565 |
12 | 11a11b64374443 |
13 | 53b2855396792 |
14 | 22692054cbbb5 |
15 | e403336e91c6 |
hex | 703df61b7873 |
123411424311411 has 8 divisors (see below), whose sum is σ = 164549026556304. Its totient is φ = 82274052470400.
The previous prime is 123411424311401. The next prime is 123411424311449. The reversal of 123411424311411 is 114113424114321.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 123411424311411 - 210 = 123411424310387 is a prime.
It is a super-2 number, since 2×1234114243114112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (123411424311401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56347266 + ... + 58496471.
It is an arithmetic number, because the mean of its divisors is an integer number (20568628319538).
Almost surely, 2123411424311411 is an apocalyptic number.
123411424311411 is a deficient number, since it is larger than the sum of its proper divisors (41137602244893).
123411424311411 is a wasteful number, since it uses less digits than its factorization.
123411424311411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115201941.
The product of its digits is 9216, while the sum is 33.
Adding to 123411424311411 its reverse (114113424114321), we get a palindrome (237524848425732).
The spelling of 123411424311411 in words is "one hundred twenty-three trillion, four hundred eleven billion, four hundred twenty-four million, three hundred eleven thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •