Base | Representation |
---|---|
bin | 10010101101001111… |
… | …11001001011101001 |
3 | 221220221010002122122 |
4 | 21112213321023221 |
5 | 131032031424001 |
6 | 4340325201025 |
7 | 503611033454 |
oct | 112647711351 |
9 | 27827102578 |
10 | 10043233001 |
11 | 429416366a |
12 | 1b43560175 |
13 | c40946729 |
14 | 6b3bb849b |
15 | 3dba9cb1b |
hex | 2569f92e9 |
10043233001 has 4 divisors (see below), whose sum is σ = 10044393600. Its totient is φ = 10042072404.
The previous prime is 10043232931. The next prime is 10043233003. The reversal of 10043233001 is 10033234001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10043233001 - 210 = 10043231977 is a prime.
It is a super-2 number, since 2×100432330012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10043233003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 567221 + ... + 584658.
It is an arithmetic number, because the mean of its divisors is an integer number (2511098400).
Almost surely, 210043233001 is an apocalyptic number.
It is an amenable number.
10043233001 is a deficient number, since it is larger than the sum of its proper divisors (1160599).
10043233001 is an equidigital number, since it uses as much as digits as its factorization.
10043233001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1160598.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 10043233001 its reverse (10033234001), we get a palindrome (20076467002).
The spelling of 10043233001 in words is "ten billion, forty-three million, two hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •