Base | Representation |
---|---|
bin | 101111000011111111100… |
… | …000000111000101110011 |
3 | 102110011210010111210010001 |
4 | 233003333200013011303 |
5 | 410441420103424243 |
6 | 10513420450050431 |
7 | 452441030355265 |
oct | 57037740070563 |
9 | 12404703453101 |
10 | 3234102014323 |
11 | 1037636301a94 |
12 | 44295a279a17 |
13 | 1a5c8900317b |
14 | b276212db35 |
15 | 591d69b8a4d |
hex | 2f0ff807173 |
3234102014323 has 8 divisors (see below), whose sum is σ = 3275022381120. Its totient is φ = 3193356148800.
The previous prime is 3234102014321. The next prime is 3234102014327.
It is a happy number.
3234102014323 is nontrivially palindromic in base 10.
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 3234102014323 - 21 = 3234102014321 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3234102014291 and 3234102014300.
It is not an unprimeable number, because it can be changed into a prime (3234102014321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 43588018 + ... + 43662151.
It is an arithmetic number, because the mean of its divisors is an integer number (409377797640).
Almost surely, 23234102014323 is an apocalyptic number.
3234102014323 is a deficient number, since it is larger than the sum of its proper divisors (40920366797).
3234102014323 is a wasteful number, since it uses less digits than its factorization.
3234102014323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87250637.
The product of its (nonzero) digits is 10368, while the sum is 28.
The spelling of 3234102014323 in words is "three trillion, two hundred thirty-four billion, one hundred two million, fourteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •