Base | Representation |
---|---|
bin | 110000001110000100… |
… | …0010000000110011011 |
3 | 100220021122201221212201 |
4 | 1200130020100012123 |
5 | 3144033042442001 |
6 | 115323140151031 |
7 | 10324044112036 |
oct | 1403410200633 |
9 | 326248657781 |
10 | 103551140251 |
11 | 3aa08a12359 |
12 | 1809b098477 |
13 | 99c3443470 |
14 | 502493201d |
15 | 2a60d99501 |
hex | 181c21019b |
103551140251 has 4 divisors (see below), whose sum is σ = 111516612592. Its totient is φ = 95585667912.
The previous prime is 103551140183. The next prime is 103551140257. The reversal of 103551140251 is 152041155301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103551140251 - 227 = 103416922523 is a prime.
It is a super-3 number, since 3×1035511402513 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103551140257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3982736151 + ... + 3982736176.
It is an arithmetic number, because the mean of its divisors is an integer number (27879153148).
Almost surely, 2103551140251 is an apocalyptic number.
103551140251 is a deficient number, since it is larger than the sum of its proper divisors (7965472341).
103551140251 is an equidigital number, since it uses as much as digits as its factorization.
103551140251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7965472340.
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 103551140251 its reverse (152041155301), we get a palindrome (255592295552).
The spelling of 103551140251 in words is "one hundred three billion, five hundred fifty-one million, one hundred forty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •