Base | Representation |
---|---|
bin | 101111110000001111001100… |
… | …010111000110001111011011 |
3 | 1000112122000011101011210011211 |
4 | 233300033030113012033123 |
5 | 210012004133302222133 |
6 | 2022403130002003551 |
7 | 62144443403163154 |
oct | 5760171427061733 |
9 | 1015560141153154 |
10 | 210023034414043 |
11 | 60a132a5701594 |
12 | 1b67ba553465b7 |
13 | 90261196656a6 |
14 | 39c125203c92b |
15 | 19432ab33dbcd |
hex | bf03cc5c63db |
210023034414043 has 4 divisors (see below), whose sum is σ = 210023465628888. Its totient is φ = 210022603199200.
The previous prime is 210023034414041. The next prime is 210023034414161. The reversal of 210023034414043 is 340414430320012.
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 210023034414043 - 21 = 210023034414041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210023034413996 and 210023034414014.
It is not an unprimeable number, because it can be changed into a prime (210023034414041) 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, 214876021 + ... + 215851222.
It is an arithmetic number, because the mean of its divisors is an integer number (52505866407222).
Almost surely, 2210023034414043 is an apocalyptic number.
210023034414043 is a deficient number, since it is larger than the sum of its proper divisors (431214845).
210023034414043 is an equidigital number, since it uses as much as digits as its factorization.
210023034414043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 431214844.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 210023034414043 its reverse (340414430320012), we get a palindrome (550437464734055).
The spelling of 210023034414043 in words is "two hundred ten trillion, twenty-three billion, thirty-four million, four hundred fourteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •