Base | Representation |
---|---|
bin | 110101110000101110… |
… | …0001001110010011101 |
3 | 102001000000011222000111 |
4 | 1223201130021302131 |
5 | 3342421024402141 |
6 | 125012044130021 |
7 | 11224664510614 |
oct | 1534134116235 |
9 | 361000158014 |
10 | 115451403421 |
11 | 44a653421a2 |
12 | 1a460536911 |
13 | ab6ba271c3 |
14 | 58331ca87b |
15 | 300a9b8381 |
hex | 1ae1709c9d |
115451403421 has 4 divisors (see below), whose sum is σ = 115509160000. Its totient is φ = 115393646844.
The previous prime is 115451403371. The next prime is 115451403439. The reversal of 115451403421 is 124304154511.
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 115451403421 - 29 = 115451402909 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 (115451403721) 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, 28875291 + ... + 28879288.
It is an arithmetic number, because the mean of its divisors is an integer number (28877290000).
Almost surely, 2115451403421 is an apocalyptic number.
It is an amenable number.
115451403421 is a deficient number, since it is larger than the sum of its proper divisors (57756579).
115451403421 is an equidigital number, since it uses as much as digits as its factorization.
115451403421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57756578.
The product of its (nonzero) digits is 9600, while the sum is 31.
Adding to 115451403421 its reverse (124304154511), we get a palindrome (239755557932).
The spelling of 115451403421 in words is "one hundred fifteen billion, four hundred fifty-one million, four hundred three thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •