Base | Representation |
---|---|
bin | 111111001010001000111… |
… | …100000011110011010111 |
3 | 120100220212000010122122102 |
4 | 333022020330003303113 |
5 | 1032102224342231201 |
6 | 13121511133352315 |
7 | 625366362550541 |
oct | 77121074036327 |
9 | 16326760118572 |
10 | 4340214414551 |
11 | 1423746984814 |
12 | 5a11b503869b |
13 | 25638523cbc2 |
14 | 1100d3304691 |
15 | 77d73da626b |
hex | 3f288f03cd7 |
4340214414551 has 16 divisors (see below), whose sum is σ = 4561237852800. Its totient is φ = 4124287335168.
The previous prime is 4340214414527. The next prime is 4340214414553. The reversal of 4340214414551 is 1554144120434.
It is a cyclic number.
It is not a de Polignac number, because 4340214414551 - 234 = 4323034545367 is a prime.
It is a super-2 number, since 2×43402144145512 (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 (4340214414553) 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 15 ways as a sum of consecutive naturals, for example, 2309216 + ... + 3743381.
It is an arithmetic number, because the mean of its divisors is an integer number (285077365800).
Almost surely, 24340214414551 is an apocalyptic number.
4340214414551 is a deficient number, since it is larger than the sum of its proper divisors (221023438249).
4340214414551 is a wasteful number, since it uses less digits than its factorization.
4340214414551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6053018.
The product of its (nonzero) digits is 153600, while the sum is 38.
Adding to 4340214414551 its reverse (1554144120434), we get a palindrome (5894358534985).
The spelling of 4340214414551 in words is "four trillion, three hundred forty billion, two hundred fourteen million, four hundred fourteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •