Base | Representation |
---|---|
bin | 1100001111110011100… |
… | …1011000111100010011 |
3 | 202010002020020011000101 |
4 | 3003330321120330103 |
5 | 11421400220124021 |
6 | 240353530433231 |
7 | 21125640552022 |
oct | 3037471307423 |
9 | 663066204011 |
10 | 210401333011 |
11 | 8125a081691 |
12 | 3493ab92817 |
13 | 16ac11c68ac |
14 | a27d6748b9 |
15 | 57166aaa91 |
hex | 30fce58f13 |
210401333011 has 8 divisors (see below), whose sum is σ = 221545082880. Its totient is φ = 199264582728.
The previous prime is 210401332937. The next prime is 210401333063. The reversal of 210401333011 is 110333104012.
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 210401333011 - 215 = 210401300243 is a prime.
It is a super-2 number, since 2×2104013330112 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 210401333011.
It is not an unprimeable number, because it can be changed into a prime (210401313011) 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, 1688131 + ... + 1808476.
It is an arithmetic number, because the mean of its divisors is an integer number (27693135360).
Almost surely, 2210401333011 is an apocalyptic number.
210401333011 is a deficient number, since it is larger than the sum of its proper divisors (11143749869).
210401333011 is a wasteful number, since it uses less digits than its factorization.
210401333011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3499793.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 210401333011 its reverse (110333104012), we get a palindrome (320734437023).
The spelling of 210401333011 in words is "two hundred ten billion, four hundred one million, three hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •