Base | Representation |
---|---|
bin | 1100011110000101000… |
… | …0100001110111011011 |
3 | 202110222020102212221110 |
4 | 3013201100201313123 |
5 | 12002222021312443 |
6 | 242230032111403 |
7 | 21322612042446 |
oct | 3074120416733 |
9 | 673866385843 |
10 | 214232604123 |
11 | 829457a134a |
12 | 3562a095563 |
13 | 17281b8c715 |
14 | a52442665d |
15 | 588cc02233 |
hex | 31e1421ddb |
214232604123 has 8 divisors (see below), whose sum is σ = 300677339200. Its totient is φ = 135304802568.
The previous prime is 214232604119. The next prime is 214232604151. The reversal of 214232604123 is 321406232412.
214232604123 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 not a de Polignac number, because 214232604123 - 22 = 214232604119 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (214232604323) 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 7 ways as a sum of consecutive naturals, for example, 1879233313 + ... + 1879233426.
It is an arithmetic number, because the mean of its divisors is an integer number (37584667400).
Almost surely, 2214232604123 is an apocalyptic number.
214232604123 is a deficient number, since it is larger than the sum of its proper divisors (86444735077).
214232604123 is a wasteful number, since it uses less digits than its factorization.
214232604123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3758466761.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 214232604123 its reverse (321406232412), we get a palindrome (535638836535).
The spelling of 214232604123 in words is "two hundred fourteen billion, two hundred thirty-two million, six hundred four thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •