Base | Representation |
---|---|
bin | 10011000011110111… |
… | …11100110101010011 |
3 | 222102011021022012022 |
4 | 21201323330311103 |
5 | 131424124241321 |
6 | 4411225322055 |
7 | 511404256322 |
oct | 114173746523 |
9 | 28364238168 |
10 | 10233040211 |
11 | 4381314629 |
12 | 1b9703632b |
13 | c710724a4 |
14 | 6d10a60b9 |
15 | 3ed591dab |
hex | 261efcd53 |
10233040211 has 4 divisors (see below), whose sum is σ = 10237326000. Its totient is φ = 10228754424.
The previous prime is 10233040199. The next prime is 10233040229. The reversal of 10233040211 is 11204033201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11204033201 = 131 ⋅85526971.
It is a cyclic number.
It is not a de Polignac number, because 10233040211 - 218 = 10232778067 is a prime.
It is a super-2 number, since 2×102330402112 (a number of 21 digits) contains 22 as substring.
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 10233040211.
It is not an unprimeable number, because it can be changed into a prime (10233040291) 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, 2139311 + ... + 2144088.
It is an arithmetic number, because the mean of its divisors is an integer number (2559331500).
Almost surely, 210233040211 is an apocalyptic number.
10233040211 is a deficient number, since it is larger than the sum of its proper divisors (4285789).
10233040211 is an equidigital number, since it uses as much as digits as its factorization.
10233040211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4285788.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10233040211 its reverse (11204033201), we get a palindrome (21437073412).
The spelling of 10233040211 in words is "ten billion, two hundred thirty-three million, forty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •