Base | Representation |
---|---|
bin | 110000001010100010… |
… | …1111110101100010111 |
3 | 100212222102122002210022 |
4 | 1200111011332230113 |
5 | 3143312333313101 |
6 | 115303322215355 |
7 | 10321111610336 |
oct | 1402505765427 |
9 | 325872562708 |
10 | 103433104151 |
11 | 3a958322063 |
12 | 1806765455b |
13 | 99a4b56410 |
14 | 5012da7d1d |
15 | 2a55830a1b |
hex | 181517eb17 |
103433104151 has 16 divisors (see below), whose sum is σ = 111682434528. Its totient is φ = 95225894400.
The previous prime is 103433104147. The next prime is 103433104163. The reversal of 103433104151 is 151401334301.
It is not a de Polignac number, because 103433104151 - 22 = 103433104147 is a prime.
It is a super-2 number, since 2×1034331041512 (a number of 23 digits) contains 22 as substring.
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 103433104151.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103433109151) 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 15 ways as a sum of consecutive naturals, for example, 11286011 + ... + 11295171.
It is an arithmetic number, because the mean of its divisors is an integer number (6980152158).
Almost surely, 2103433104151 is an apocalyptic number.
103433104151 is a deficient number, since it is larger than the sum of its proper divisors (8249330377).
103433104151 is a wasteful number, since it uses less digits than its factorization.
103433104151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11362.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 103433104151 its reverse (151401334301), we get a palindrome (254834438452).
The spelling of 103433104151 in words is "one hundred three billion, four hundred thirty-three million, one hundred four thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •