Base | Representation |
---|---|
bin | 100100000011100010010… |
… | …0001010101101010010101 |
3 | 122112201201221202010221102 |
4 | 1020013010201111222111 |
5 | 1122142121424203401 |
6 | 14312250550555445 |
7 | 1021005202062224 |
oct | 110070441255225 |
9 | 18481657663842 |
10 | 4955394366101 |
11 | 1640630a29613 |
12 | 68047b668b85 |
13 | 29c3a3aa125a |
14 | 131bb1652cbb |
15 | 88d7b73256b |
hex | 481c4855a95 |
4955394366101 has 4 divisors (see below), whose sum is σ = 5060828288832. Its totient is φ = 4849960443372.
The previous prime is 4955394366089. The next prime is 4955394366127. The reversal of 4955394366101 is 1016634935594.
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 a de Polignac number, because none of the positive numbers 2k-4955394366101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4955394366191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52716961295 + ... + 52716961388.
It is an arithmetic number, because the mean of its divisors is an integer number (1265207072208).
Almost surely, 24955394366101 is an apocalyptic number.
It is an amenable number.
4955394366101 is a deficient number, since it is larger than the sum of its proper divisors (105433922731).
4955394366101 is a wasteful number, since it uses less digits than its factorization.
4955394366101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105433922730.
The product of its (nonzero) digits is 10497600, while the sum is 56.
The spelling of 4955394366101 in words is "four trillion, nine hundred fifty-five billion, three hundred ninety-four million, three hundred sixty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •