Base | Representation |
---|---|
bin | 111101100111010110101… |
… | …010010011101011011001 |
3 | 112222210001210022112102122 |
4 | 331213112222103223121 |
5 | 1023333011403421213 |
6 | 13001050004511025 |
7 | 614623016611646 |
oct | 75472652235331 |
9 | 15883053275378 |
10 | 4234144201433 |
11 | 1392766021763 |
12 | 5847323ab475 |
13 | 24937cc4cba3 |
14 | 108d0ddd8dcd |
15 | 75216cb4d08 |
hex | 3d9d6a93ad9 |
4234144201433 has 8 divisors (see below), whose sum is σ = 4295841529536. Its totient is φ = 4172504137200.
The previous prime is 4234144201393. The next prime is 4234144201457. The reversal of 4234144201433 is 3341024414324.
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 4234144201433 - 210 = 4234144200409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4234144201393 and 4234144201402.
It is not an unprimeable number, because it can be changed into a prime (4234144231433) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14166998 + ... + 14462783.
It is an arithmetic number, because the mean of its divisors is an integer number (536980191192).
Almost surely, 24234144201433 is an apocalyptic number.
It is an amenable number.
4234144201433 is a deficient number, since it is larger than the sum of its proper divisors (61697328103).
4234144201433 is a wasteful number, since it uses less digits than its factorization.
4234144201433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28631935.
The product of its (nonzero) digits is 110592, while the sum is 35.
Adding to 4234144201433 its reverse (3341024414324), we get a palindrome (7575168615757).
The spelling of 4234144201433 in words is "four trillion, two hundred thirty-four billion, one hundred forty-four million, two hundred one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •