Base | Representation |
---|---|
bin | 1100001110010111010… |
… | …0101110001000111001 |
3 | 202002002020211102211022 |
4 | 3003211310232020321 |
5 | 11420102120430040 |
6 | 240251301512225 |
7 | 21113230346003 |
oct | 3034564561071 |
9 | 662066742738 |
10 | 210014233145 |
11 | 81080617842 |
12 | 34851412675 |
13 | 16a5bc50c12 |
14 | a2440ab373 |
15 | 56e26e46b5 |
hex | 30e5d2e239 |
210014233145 has 8 divisors (see below), whose sum is σ = 262974344256. Its totient is φ = 160706543536.
The previous prime is 210014233127. The next prime is 210014233151. The reversal of 210014233145 is 541332410012.
It is a happy number.
210014233145 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 210014233145 - 230 = 208940491321 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 913105247 + ... + 913105476.
It is an arithmetic number, because the mean of its divisors is an integer number (32871793032).
Almost surely, 2210014233145 is an apocalyptic number.
It is an amenable number.
210014233145 is a deficient number, since it is larger than the sum of its proper divisors (52960111111).
210014233145 is a wasteful number, since it uses less digits than its factorization.
210014233145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1826210751.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 210014233145 its reverse (541332410012), we get a palindrome (751346643157).
The spelling of 210014233145 in words is "two hundred ten billion, fourteen million, two hundred thirty-three thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •