Base | Representation |
---|---|
bin | 101110110001110000101… |
… | …000100010111011011111 |
3 | 102101022020210022022021101 |
4 | 232301300220202323133 |
5 | 410131321423330211 |
6 | 10500422115213531 |
7 | 451145634331036 |
oct | 56616050427337 |
9 | 12338223268241 |
10 | 3214525214431 |
11 | 102a2aa754523 |
12 | 43abb5ba72a7 |
13 | 1a41892009cb |
14 | b182612b71d |
15 | 5893ce955c1 |
hex | 2ec70a22edf |
3214525214431 has 8 divisors (see below), whose sum is σ = 3218971250880. Its totient is φ = 3210080214048.
The previous prime is 3214525214429. The next prime is 3214525214437. The reversal of 3214525214431 is 1344125254123.
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 3214525214431 - 21 = 3214525214429 is a prime.
It is a super-2 number, since 2×32145252144312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3214525214437) 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, 6056785 + ... + 6566101.
It is an arithmetic number, because the mean of its divisors is an integer number (402371406360).
Almost surely, 23214525214431 is an apocalyptic number.
3214525214431 is a deficient number, since it is larger than the sum of its proper divisors (4446036449).
3214525214431 is an equidigital number, since it uses as much as digits as its factorization.
3214525214431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518033.
The product of its digits is 115200, while the sum is 37.
The spelling of 3214525214431 in words is "three trillion, two hundred fourteen billion, five hundred twenty-five million, two hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •