Base | Representation |
---|---|
bin | 10110101001010001100100… |
… | …000111001010111000000001 |
3 | 111001122000220222102101000001 |
4 | 112221101210013022320001 |
5 | 101023214221100321201 |
6 | 551452322344000001 |
7 | 26656245554655421 |
oct | 2651214407127001 |
9 | 431560828371001 |
10 | 99593381260801 |
11 | 2980835236708a |
12 | b205a45a60001 |
13 | 43758004b199c |
14 | 1a844b99ba481 |
15 | b7a9bbcbd301 |
hex | 5a94641cae01 |
99593381260801 has 4 divisors (see below), whose sum is σ = 99595056087472. Its totient is φ = 99591706434132.
The previous prime is 99593381260799. The next prime is 99593381260819. The reversal of 99593381260801 is 10806218339599.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 99593381260801 - 21 = 99593381260799 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (99593381260001) 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 3 ways as a sum of consecutive naturals, for example, 837324135 + ... + 837443068.
It is an arithmetic number, because the mean of its divisors is an integer number (24898764021868).
Almost surely, 299593381260801 is an apocalyptic number.
It is an amenable number.
99593381260801 is a deficient number, since it is larger than the sum of its proper divisors (1674826671).
99593381260801 is a wasteful number, since it uses less digits than its factorization.
99593381260801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1674826670.
The product of its (nonzero) digits is 25194240, while the sum is 64.
The spelling of 99593381260801 in words is "ninety-nine trillion, five hundred ninety-three billion, three hundred eighty-one million, two hundred sixty thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •