Base | Representation |
---|---|
bin | 1011000100100011111… |
… | …1111001011111011001 |
3 | 200011221121000021221101 |
4 | 2301020333321133121 |
5 | 11104014014134004 |
6 | 223213404111401 |
7 | 16512262062154 |
oct | 2611077713731 |
9 | 604847007841 |
10 | 190203271129 |
11 | 73734873863 |
12 | 30a42835561 |
13 | 14c22792ba1 |
14 | 92c4d52c9b |
15 | 4e33369ba4 |
hex | 2c48ff97d9 |
190203271129 has 9 divisors (see below), whose sum is σ = 191553814207. Its totient is φ = 188862192904.
The previous prime is 190203271127. The next prime is 190203271211. The reversal of 190203271129 is 921172302091.
The square root of 190203271129 is 436123.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 22283622729 + 167919648400 = 149277^2 + 409780^2 .
It is not a de Polignac number, because 190203271129 - 21 = 190203271127 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (190203271127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 64980864 + ... + 64983790.
Almost surely, 2190203271129 is an apocalyptic number.
190203271129 is the 436123-rd square number.
190203271129 is the 218062-nd centered octagonal number.
It is an amenable number.
190203271129 is a deficient number, since it is larger than the sum of its proper divisors (1350543078).
190203271129 is an frugal number, since it uses more digits than its factorization.
190203271129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6152 (or 3076 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 37.
The spelling of 190203271129 in words is "one hundred ninety billion, two hundred three million, two hundred seventy-one thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •