Base | Representation |
---|---|
bin | 10111011111001110100101… |
… | …010000100111000011101111 |
3 | 111112202111000110120122011010 |
4 | 113133032211100213003233 |
5 | 102014441002420443043 |
6 | 1003411501042000303 |
7 | 30521152564014240 |
oct | 2737164520470357 |
9 | 445674013518133 |
10 | 103301031031023 |
11 | 2aa077a2a68001 |
12 | b704522346093 |
13 | 4584326287c77 |
14 | 1b71b21b54cc7 |
15 | be216be83133 |
hex | 5df3a54270ef |
103301031031023 has 32 divisors (see below), whose sum is σ = 170546630893056. Its totient is φ = 54264837086208.
The previous prime is 103301031030983. The next prime is 103301031031027. The reversal of 103301031031023 is 320130130103301.
It is not a de Polignac number, because 103301031031023 - 212 = 103301031026927 is a prime.
It is a super-2 number, since 2×1033010310310232 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103301031031027) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3364619886 + ... + 3364650587.
It is an arithmetic number, because the mean of its divisors is an integer number (5329582215408).
Almost surely, 2103301031031023 is an apocalyptic number.
103301031031023 is a deficient number, since it is larger than the sum of its proper divisors (67245599862033).
103301031031023 is a wasteful number, since it uses less digits than its factorization.
103301031031023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6729270543.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 103301031031023 its reverse (320130130103301), we get a palindrome (423431161134324).
The spelling of 103301031031023 in words is "one hundred three trillion, three hundred one billion, thirty-one million, thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •