Base | Representation |
---|---|
bin | 110101100100111000… |
… | …1110010000010101111 |
3 | 101222222100012010100010 |
4 | 1223021301302002233 |
5 | 3341112412421033 |
6 | 124504423304303 |
7 | 11212104302145 |
oct | 1531161620257 |
9 | 358870163303 |
10 | 115054420143 |
11 | 44881247843 |
12 | 1a36b5ab093 |
13 | ab07700a60 |
14 | 57d65ad595 |
15 | 2ed5bed863 |
hex | 1ac9c720af |
115054420143 has 32 divisors (see below), whose sum is σ = 173930901760. Its totient is φ = 67064889600.
The previous prime is 115054420123. The next prime is 115054420157. The reversal of 115054420143 is 341024450511.
It is not a de Polignac number, because 115054420143 - 25 = 115054420111 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 115054420143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115054420123) 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 31 ways as a sum of consecutive naturals, for example, 6603243 + ... + 6620643.
It is an arithmetic number, because the mean of its divisors is an integer number (5435340680).
Almost surely, 2115054420143 is an apocalyptic number.
115054420143 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
115054420143 is a deficient number, since it is larger than the sum of its proper divisors (58876481617).
115054420143 is a wasteful number, since it uses less digits than its factorization.
115054420143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26359.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 115054420143 its reverse (341024450511), we get a palindrome (456078870654).
The spelling of 115054420143 in words is "one hundred fifteen billion, fifty-four million, four hundred twenty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •