Base | Representation |
---|---|
bin | 111001011111001110… |
… | …0000111010001001010 |
3 | 102210122201201100101211 |
4 | 1302332130013101022 |
5 | 4010313224001010 |
6 | 132414122203334 |
7 | 11630210515030 |
oct | 1627634072112 |
9 | 383581640354 |
10 | 123454125130 |
11 | 483a16a9496 |
12 | 1bb1465354a |
13 | b8459b10ab |
14 | 5d91da2550 |
15 | 332835008a |
hex | 1cbe70744a |
123454125130 has 64 divisors (see below), whose sum is σ = 254655498240. Its totient is φ = 42211862784.
The previous prime is 123454125101. The next prime is 123454125139. The reversal of 123454125130 is 31521454321.
It is a super-2 number, since 2×1234541251302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 123454125092 and 123454125101.
It is not an unprimeable number, because it can be changed into a prime (123454125139) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 67719399 + ... + 67721221.
It is an arithmetic number, because the mean of its divisors is an integer number (3978992160).
Almost surely, 2123454125130 is an apocalyptic number.
123454125130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
123454125130 is an abundant number, since it is smaller than the sum of its proper divisors (131201373110).
123454125130 is a wasteful number, since it uses less digits than its factorization.
123454125130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3943.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 123454125130 its reverse (31521454321), we get a palindrome (154975579451).
The spelling of 123454125130 in words is "one hundred twenty-three billion, four hundred fifty-four million, one hundred twenty-five thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •