Base | Representation |
---|---|
bin | 101010111000001011010… |
… | …1011000011000000110110 |
3 | 202212101001120020211202210 |
4 | 1111300112223003000312 |
5 | 1233023004312412043 |
6 | 20311124100114250 |
7 | 1145521622242113 |
oct | 125602653030066 |
9 | 22771046224683 |
10 | 5893075513398 |
11 | 197226a54a057 |
12 | 7b214b095986 |
13 | 33993a096608 |
14 | 16532526b90a |
15 | a345bd9d633 |
hex | 55c16ac3036 |
5893075513398 has 16 divisors (see below), whose sum is σ = 12192570028080. Its totient is φ = 1896622004256.
The previous prime is 5893075513397. The next prime is 5893075513417. The reversal of 5893075513398 is 8933155703985.
It is a super-2 number, since 2×58930755133982 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5893075513397) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 16934124865 + ... + 16934125212.
It is an arithmetic number, because the mean of its divisors is an integer number (762035626755).
Almost surely, 25893075513398 is an apocalyptic number.
5893075513398 is a gapful number since it is divisible by the number (58) formed by its first and last digit.
5893075513398 is an abundant number, since it is smaller than the sum of its proper divisors (6299494514682).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5893075513398 is a wasteful number, since it uses less digits than its factorization.
5893075513398 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33868250111.
The product of its (nonzero) digits is 122472000, while the sum is 66.
The spelling of 5893075513398 in words is "five trillion, eight hundred ninety-three billion, seventy-five million, five hundred thirteen thousand, three hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •