Base | Representation |
---|---|
bin | 10111011110001100011100… |
… | …101011000010010100111101 |
3 | 111112111200201120210122202010 |
4 | 113132030130223002110331 |
5 | 102012310040110100013 |
6 | 1003315114433121433 |
7 | 30513060062153352 |
oct | 2736143453022475 |
9 | 445450646718663 |
10 | 103230020003133 |
11 | 2a98a6730aa7a1 |
12 | b6b28049b9279 |
13 | 457a71a541a7a |
14 | 1b6c506b60629 |
15 | be03b2c137c3 |
hex | 5de31cac253d |
103230020003133 has 32 divisors (see below), whose sum is σ = 142650741692160. Its totient is φ = 66323530183680.
The previous prime is 103230020003111. The next prime is 103230020003177. The reversal of 103230020003133 is 331300020032301.
It is not a de Polignac number, because 103230020003133 - 29 = 103230020002621 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103230020003533) 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, 202699891 + ... + 203208527.
It is an arithmetic number, because the mean of its divisors is an integer number (4457835677880).
Almost surely, 2103230020003133 is an apocalyptic number.
It is an amenable number.
103230020003133 is a deficient number, since it is larger than the sum of its proper divisors (39420721689027).
103230020003133 is a wasteful number, since it uses less digits than its factorization.
103230020003133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 512997.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 103230020003133 its reverse (331300020032301), we get a palindrome (434530040035434).
The spelling of 103230020003133 in words is "one hundred three trillion, two hundred thirty billion, twenty million, three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •