Base | Representation |
---|---|
bin | 100011010001001111011101… |
… | …100000100101010000001101 |
3 | 202100012222200211000002221112 |
4 | 203101033131200211100031 |
5 | 130312412002302412343 |
6 | 1305523303522541405 |
7 | 44446536325661255 |
oct | 4321173540452015 |
9 | 670188624002845 |
10 | 155116460200973 |
11 | 454745809a64a7 |
12 | 15492738807865 |
13 | 687255b6549ab |
14 | 2a43968d4a965 |
15 | 12dee05e87218 |
hex | 8d13dd82540d |
155116460200973 has 2 divisors, whose sum is σ = 155116460200974. Its totient is φ = 155116460200972.
The previous prime is 155116460200969. The next prime is 155116460200981. The reversal of 155116460200973 is 379002064611551.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 137253479163529 + 17862981037444 = 11715523^2 + 4226462^2 .
It is a cyclic number.
It is not a de Polignac number, because 155116460200973 - 22 = 155116460200969 is a prime.
It is a super-2 number, since 2×1551164602009732 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (155116460200913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 77558230100486 + 77558230100487.
It is an arithmetic number, because the mean of its divisors is an integer number (77558230100487).
Almost surely, 2155116460200973 is an apocalyptic number.
It is an amenable number.
155116460200973 is a deficient number, since it is larger than the sum of its proper divisors (1).
155116460200973 is an equidigital number, since it uses as much as digits as its factorization.
155116460200973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1360800, while the sum is 50.
The spelling of 155116460200973 in words is "one hundred fifty-five trillion, one hundred sixteen billion, four hundred sixty million, two hundred thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •