Base | Representation |
---|---|
bin | 1001010010010111110011… |
… | …1011110010100100101111 |
3 | 1100011011222101222021010012 |
4 | 2110211330323302210233 |
5 | 2314300101211423043 |
6 | 33414550440003435 |
7 | 2102510611020233 |
oct | 224457473624457 |
9 | 40134871867105 |
10 | 10211233311023 |
11 | 3287617aa8038 |
12 | 118b00946057b |
13 | 590bb88203a4 |
14 | 2743250945c3 |
15 | 12a93e690a18 |
hex | 9497cef292f |
10211233311023 has 4 divisors (see below), whose sum is σ = 10234283499528. Its totient is φ = 10188183122520.
The previous prime is 10211233310987. The next prime is 10211233311053. The reversal of 10211233311023 is 32011333211201.
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 10211233311023 - 216 = 10211233245487 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10211233311023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211233311053) 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, 11525093588 + ... + 11525094473.
It is an arithmetic number, because the mean of its divisors is an integer number (2558570874882).
Almost surely, 210211233311023 is an apocalyptic number.
10211233311023 is a deficient number, since it is larger than the sum of its proper divisors (23050188505).
10211233311023 is an equidigital number, since it uses as much as digits as its factorization.
10211233311023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23050188504.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10211233311023 its reverse (32011333211201), we get a palindrome (42222566522224).
The spelling of 10211233311023 in words is "ten trillion, two hundred eleven billion, two hundred thirty-three million, three hundred eleven thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •