Base | Representation |
---|---|
bin | 1010110100010100111010101… |
… | …1001010011011001110010001 |
3 | 10200211021001111012211102021020 |
4 | 2231011032223022123032101 |
5 | 1244233322411441442231 |
6 | 11254552141133550053 |
7 | 316224300633244062 |
oct | 25505165312331621 |
9 | 3624231435742236 |
10 | 761221400343441 |
11 | 200604201547064 |
12 | 71461982945329 |
13 | 26899b4063255b |
14 | d5d9453188569 |
15 | 5d011aeda8396 |
hex | 2b453ab29b391 |
761221400343441 has 32 divisors (see below), whose sum is σ = 1018677890580480. Its totient is φ = 505624416091200.
The previous prime is 761221400343413. The next prime is 761221400343449. The reversal of 761221400343441 is 144343004122167.
761221400343441 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 761221400343441 - 25 = 761221400343409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 761221400343393 and 761221400343402.
It is not an unprimeable number, because it can be changed into a prime (761221400343449) 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, 45573924496 + ... + 45573941198.
It is an arithmetic number, because the mean of its divisors is an integer number (31833684080640).
Almost surely, 2761221400343441 is an apocalyptic number.
It is an amenable number.
761221400343441 is a deficient number, since it is larger than the sum of its proper divisors (257456490237039).
761221400343441 is a wasteful number, since it uses less digits than its factorization.
761221400343441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35797.
The product of its (nonzero) digits is 387072, while the sum is 42.
The spelling of 761221400343441 in words is "seven hundred sixty-one trillion, two hundred twenty-one billion, four hundred million, three hundred forty-three thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •