Base | Representation |
---|---|
bin | 111001100001011111… |
… | …1010001100010111011 |
3 | 102210212001100002222202 |
4 | 1303002333101202323 |
5 | 4010442243414011 |
6 | 132425450140415 |
7 | 11632125336563 |
oct | 1630277214273 |
9 | 383761302882 |
10 | 123530451131 |
11 | 484307a032a |
12 | 1bb3612170b |
13 | b8587560c9 |
14 | 5d9c18dda3 |
15 | 332edca23b |
hex | 1cc2fd18bb |
123530451131 has 8 divisors (see below), whose sum is σ = 123631384800. Its totient is φ = 123429563712.
The previous prime is 123530451103. The next prime is 123530451157. The reversal of 123530451131 is 131154035321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 123530451131 - 26 = 123530451067 is a prime.
It is a super-2 number, since 2×1235304511312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 123530451094 and 123530451103.
It is not an unprimeable number, because it can be changed into a prime (123530451731) 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, 6906506 + ... + 6924368.
It is an arithmetic number, because the mean of its divisors is an integer number (15453923100).
Almost surely, 2123530451131 is an apocalyptic number.
123530451131 is a deficient number, since it is larger than the sum of its proper divisors (100933669).
123530451131 is a wasteful number, since it uses less digits than its factorization.
123530451131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23125.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 123530451131 its reverse (131154035321), we get a palindrome (254684486452).
The spelling of 123530451131 in words is "one hundred twenty-three billion, five hundred thirty million, four hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •