Base | Representation |
---|---|
bin | 111001011111011110… |
… | …1111110110010110010 |
3 | 102210200100102101222110 |
4 | 1302332331332302302 |
5 | 4010323012101224 |
6 | 132415040350150 |
7 | 11630346132660 |
oct | 1627675766262 |
9 | 383610371873 |
10 | 123463003314 |
11 | 483a6712832 |
12 | 1bb17615356 |
13 | b84779c161 |
14 | 5d93233c30 |
15 | 3329005929 |
hex | 1cbef7ecb2 |
123463003314 has 128 divisors (see below), whose sum is σ = 301617653760. Its totient is φ = 32906663424.
The previous prime is 123463003309. The next prime is 123463003327. The reversal of 123463003314 is 413300364321.
It is a super-2 number, since 2×1234630033142 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 45844552 + ... + 45847244.
It is an arithmetic number, because the mean of its divisors is an integer number (2356387920).
Almost surely, 2123463003314 is an apocalyptic number.
123463003314 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 123463003314, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150808826880).
123463003314 is an abundant number, since it is smaller than the sum of its proper divisors (178154650446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123463003314 is a wasteful number, since it uses less digits than its factorization.
123463003314 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3584.
The product of its (nonzero) digits is 15552, while the sum is 30.
Adding to 123463003314 its reverse (413300364321), we get a palindrome (536763367635).
The spelling of 123463003314 in words is "one hundred twenty-three billion, four hundred sixty-three million, three thousand, three hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •