Base | Representation |
---|---|
bin | 11100000001100110100010… |
… | …011010101110111010101100 |
3 | 121011102002201211212020101012 |
4 | 130001212202122232322230 |
5 | 112123404030230111340 |
6 | 1114050425535004352 |
7 | 34650623514462542 |
oct | 3401464232567254 |
9 | 534362654766335 |
10 | 123255401410220 |
11 | 3630035a91a622 |
12 | 119a78806696b8 |
13 | 53a0c1c090781 |
14 | 2261843c89d92 |
15 | e3b250eab565 |
hex | 7019a26aeeac |
123255401410220 has 48 divisors (see below), whose sum is σ = 258918739954560. Its totient is φ = 49286467386624.
The previous prime is 123255401410121. The next prime is 123255401410241. The reversal of 123255401410220 is 22014104552321.
It is an unprimeable number.
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, 1934083997 + ... + 1934147723.
It is an arithmetic number, because the mean of its divisors is an integer number (5394140415720).
Almost surely, 2123255401410220 is an apocalyptic number.
123255401410220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123255401410220 is an abundant number, since it is smaller than the sum of its proper divisors (135663338544340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123255401410220 is a wasteful number, since it uses less digits than its factorization.
123255401410220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93002 (or 93000 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 32.
Adding to 123255401410220 its reverse (22014104552321), we get a palindrome (145269505962541).
The spelling of 123255401410220 in words is "one hundred twenty-three trillion, two hundred fifty-five billion, four hundred one million, four hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •