Base | Representation |
---|---|
bin | 100100101011011100100… |
… | …1110111010011001110001 |
3 | 122211220222020011120011201 |
4 | 1021112321032322121301 |
5 | 1130043140202114101 |
6 | 14415503521011201 |
7 | 1030131156552004 |
oct | 111267116723161 |
9 | 18756866146151 |
10 | 5041104332401 |
11 | 1673a13a79905 |
12 | 694bbb783b01 |
13 | 2a74b2b83447 |
14 | 135dc289d53b |
15 | 8b1e6147e01 |
hex | 495b93ba671 |
5041104332401 has 16 divisors (see below), whose sum is σ = 5065954099200. Its totient is φ = 5016321756160.
The previous prime is 5041104332393. The next prime is 5041104332413. The reversal of 5041104332401 is 1042334011405.
It is a cyclic number.
It is not a de Polignac number, because 5041104332401 - 23 = 5041104332393 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 5041104332401.
It is not an unprimeable number, because it can be changed into a prime (5041104332471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 820622736 + ... + 820628878.
It is an arithmetic number, because the mean of its divisors is an integer number (316622131200).
Almost surely, 25041104332401 is an apocalyptic number.
It is an amenable number.
5041104332401 is a deficient number, since it is larger than the sum of its proper divisors (24849766799).
5041104332401 is a wasteful number, since it uses less digits than its factorization.
5041104332401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10976.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 5041104332401 its reverse (1042334011405), we get a palindrome (6083438343806).
The spelling of 5041104332401 in words is "five trillion, forty-one billion, one hundred four million, three hundred thirty-two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •