Base | Representation |
---|---|
bin | 101001000010011001101… |
… | …0000111001001110111111 |
3 | 201222012012220021112120222 |
4 | 1102010303100321032333 |
5 | 1214402012421021044 |
6 | 15555014454131555 |
7 | 1121326141025150 |
oct | 122046320711677 |
9 | 21865186245528 |
10 | 5640152126399 |
11 | 1884a7a92299a |
12 | 771123650bbb |
13 | 31bb30468a3b |
14 | 156db04b7927 |
15 | 9baa75c58ee |
hex | 521334393bf |
5640152126399 has 8 divisors (see below), whose sum is σ = 6446025617568. Its totient is φ = 4834313003520.
The previous prime is 5640152126383. The next prime is 5640152126563. The reversal of 5640152126399 is 9936212510465.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5640152126399 - 24 = 5640152126383 is a prime.
It is a super-2 number, since 2×56401521263992 (a number of 26 digits) contains 22 as substring.
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 5640152126399.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5640152129399) 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, 8239442 + ... + 8897679.
It is an arithmetic number, because the mean of its divisors is an integer number (805753202196).
Almost surely, 25640152126399 is an apocalyptic number.
5640152126399 is a deficient number, since it is larger than the sum of its proper divisors (805873491169).
5640152126399 is a wasteful number, since it uses less digits than its factorization.
5640152126399 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17184145.
The product of its (nonzero) digits is 3499200, while the sum is 53.
The spelling of 5640152126399 in words is "five trillion, six hundred forty billion, one hundred fifty-two million, one hundred twenty-six thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •