Base | Representation |
---|---|
bin | 1101101111001111001000… |
… | …01000000100001000111011 |
3 | 10221222002011000001021122022 |
4 | 12313213210020010020323 |
5 | 12424431230032441443 |
6 | 144130233550345055 |
7 | 6235424124503165 |
oct | 667474410041073 |
9 | 127862130037568 |
10 | 30210332312123 |
11 | 9698148010287 |
12 | 347ab6b1bb18b |
13 | 13b1a8c24ab82 |
14 | 76628b7b5935 |
15 | 375c9039de68 |
hex | 1b79e420423b |
30210332312123 has 4 divisors (see below), whose sum is σ = 30211393208400. Its totient is φ = 30209271415848.
The previous prime is 30210332312093. The next prime is 30210332312137. The reversal of 30210332312123 is 32121323301203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 30210332312123 - 26 = 30210332312059 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30210332312092 and 30210332312101.
It is not an unprimeable number, because it can be changed into a prime (30210332312183) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 530405423 + ... + 530462376.
It is an arithmetic number, because the mean of its divisors is an integer number (7552848302100).
Almost surely, 230210332312123 is an apocalyptic number.
30210332312123 is a deficient number, since it is larger than the sum of its proper divisors (1060896277).
30210332312123 is a wasteful number, since it uses less digits than its factorization.
30210332312123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1060896276.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 30210332312123 its reverse (32121323301203), we get a palindrome (62331655613326).
The spelling of 30210332312123 in words is "thirty trillion, two hundred ten billion, three hundred thirty-two million, three hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •