Base | Representation |
---|---|
bin | 1101101100101101011100… |
… | …00001110000111100010011 |
3 | 10221122210002021102110020111 |
4 | 12312112232001300330103 |
5 | 12422020434442020133 |
6 | 144022320112022151 |
7 | 6226232016451414 |
oct | 666265601607423 |
9 | 127583067373214 |
10 | 30123525345043 |
11 | 9664351814079 |
12 | 3466183831957 |
13 | 13a6836ac81b0 |
14 | 761db49ab80b |
15 | 3738ae4e61cd |
hex | 1b65ae070f13 |
30123525345043 has 16 divisors (see below), whose sum is σ = 32691523721472. Its totient is φ = 27591397236000.
The previous prime is 30123525345041. The next prime is 30123525345119. The reversal of 30123525345043 is 34054352532103.
It is not a de Polignac number, because 30123525345043 - 21 = 30123525345041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30123525344987 and 30123525345005.
It is not an unprimeable number, because it can be changed into a prime (30123525345041) by changing a digit.
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, 16844728 + ... + 18547018.
It is an arithmetic number, because the mean of its divisors is an integer number (2043220232592).
Almost surely, 230123525345043 is an apocalyptic number.
30123525345043 is a deficient number, since it is larger than the sum of its proper divisors (2567998376429).
30123525345043 is a wasteful number, since it uses less digits than its factorization.
30123525345043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1712826.
The product of its (nonzero) digits is 648000, while the sum is 40.
Adding to 30123525345043 its reverse (34054352532103), we get a palindrome (64177877877146).
The spelling of 30123525345043 in words is "thirty trillion, one hundred twenty-three billion, five hundred twenty-five million, three hundred forty-five thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •