Base | Representation |
---|---|
bin | 1001010010011110110110… |
… | …0001110101010111011011 |
3 | 1100011100212001111110220122 |
4 | 2110213231201311113123 |
5 | 2314312433304111443 |
6 | 33415502120143455 |
7 | 2102605456312334 |
oct | 224475541652733 |
9 | 40140761443818 |
10 | 10213122332123 |
11 | 32883a73345a7 |
12 | 118b456007b8b |
13 | 591129cab959 |
14 | 274463d0128b |
15 | 12aa00430968 |
hex | 949ed8755db |
10213122332123 has 8 divisors (see below), whose sum is σ = 10330854019200. Its totient is φ = 10095456811968.
The previous prime is 10213122332107. The next prime is 10213122332129. The reversal of 10213122332123 is 32123322131201.
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 10213122332123 - 24 = 10213122332107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10213122332092 and 10213122332101.
It is not an unprimeable number, because it can be changed into a prime (10213122332129) 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, 16231211 + ... + 16848692.
It is an arithmetic number, because the mean of its divisors is an integer number (1291356752400).
Almost surely, 210213122332123 is an apocalyptic number.
10213122332123 is a deficient number, since it is larger than the sum of its proper divisors (117731687077).
10213122332123 is an equidigital number, since it uses as much as digits as its factorization.
10213122332123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33083461.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 10213122332123 its reverse (32123322131201), we get a palindrome (42336444463324).
The spelling of 10213122332123 in words is "ten trillion, two hundred thirteen billion, one hundred twenty-two million, three hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •