Base | Representation |
---|---|
bin | 10011001001111100001110… |
… | …00111000000010001000001 |
3 | 12112010220212001201202100111 |
4 | 21210332013013000101001 |
5 | 21010120411311012004 |
6 | 225331013310351321 |
7 | 11605200324055366 |
oct | 1144760707002101 |
9 | 175126761652314 |
10 | 42123011032129 |
11 | 124702a5645a85 |
12 | 488387b1bb541 |
13 | 1a6724ba90cc1 |
14 | a58a9c14a46d |
15 | 4d0ab21c2a04 |
hex | 264f871c0441 |
42123011032129 has 2 divisors, whose sum is σ = 42123011032130. Its totient is φ = 42123011032128.
The previous prime is 42123011032087. The next prime is 42123011032231. The reversal of 42123011032129 is 92123011032124.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 41522262025729 + 600749006400 = 6443777^2 + 775080^2 .
It is a cyclic number.
It is not a de Polignac number, because 42123011032129 - 233 = 42114421097537 is a prime.
It is a super-2 number, since 2×421230110321292 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42123011032129.
It is not a weakly prime, because it can be changed into another prime (42123011030129) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21061505516064 + 21061505516065.
It is an arithmetic number, because the mean of its divisors is an integer number (21061505516065).
Almost surely, 242123011032129 is an apocalyptic number.
It is an amenable number.
42123011032129 is a deficient number, since it is larger than the sum of its proper divisors (1).
42123011032129 is an equidigital number, since it uses as much as digits as its factorization.
42123011032129 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 42123011032129 in words is "forty-two trillion, one hundred twenty-three billion, eleven million, thirty-two thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •