Base | Representation |
---|---|
bin | 10010000000001… |
… | …10001001000111 |
3 | 101112011121122011 |
4 | 21000012021013 |
5 | 302130120403 |
6 | 22552515051 |
7 | 3512435563 |
oct | 1100061107 |
9 | 345147564 |
10 | 151020103 |
11 | 78279703 |
12 | 426aba87 |
13 | 25398310 |
14 | 160b26a3 |
15 | d3d1a6d |
hex | 9006247 |
151020103 has 4 divisors (see below), whose sum is σ = 162637048. Its totient is φ = 139403160.
The previous prime is 151020101. The next prime is 151020119. The reversal of 151020103 is 301020151.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 151020103 - 21 = 151020101 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13), and also a Moran number because the ratio is a prime number: 11616931 = 151020103 / (1 + 5 + 1 + 0 + 2 + 0 + 1 + 0 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (151020101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5808453 + ... + 5808478.
It is an arithmetic number, because the mean of its divisors is an integer number (40659262).
Almost surely, 2151020103 is an apocalyptic number.
151020103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
151020103 is a deficient number, since it is larger than the sum of its proper divisors (11616945).
151020103 is a wasteful number, since it uses less digits than its factorization.
151020103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11616944.
The product of its (nonzero) digits is 30, while the sum is 13.
The square root of 151020103 is about 12289.0236796908. The cubic root of 151020103 is about 532.5310324513.
Adding to 151020103 its reverse (301020151), we get a palindrome (452040254).
The spelling of 151020103 in words is "one hundred fifty-one million, twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •