Base | Representation |
---|---|
bin | 101011001010100000010… |
… | …1001000100000111111011 |
3 | 210000010122112211112000002 |
4 | 1112111000221010013323 |
5 | 1234144111142424040 |
6 | 20341153412303215 |
7 | 1151414152620521 |
oct | 126250051040773 |
9 | 23003575745002 |
10 | 5932434342395 |
11 | 1987a27589900 |
12 | 7b98b4311b0b |
13 | 340570366742 |
14 | 1671ba616311 |
15 | a44b2433a15 |
hex | 56540a441fb |
5932434342395 has 24 divisors (see below), whose sum is σ = 7991417835072. Its totient is φ = 4222699859840.
The previous prime is 5932434342389. The next prime is 5932434342407.
5932434342395 is nontrivially palindromic in base 10.
It is a de Polignac number, because none of the positive numbers 2k-5932434342395 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5932434342395.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 104287274 + ... + 104344143.
It is an arithmetic number, because the mean of its divisors is an integer number (332975743128).
Almost surely, 25932434342395 is an apocalyptic number.
5932434342395 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5932434342395 is a deficient number, since it is larger than the sum of its proper divisors (2058983492677).
5932434342395 is a wasteful number, since it uses less digits than its factorization.
5932434342395 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 208631491 (or 208631480 counting only the distinct ones).
The product of its digits is 41990400, while the sum is 56.
The spelling of 5932434342395 in words is "five trillion, nine hundred thirty-two billion, four hundred thirty-four million, three hundred forty-two thousand, three hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •