Base | Representation |
---|---|
bin | 10100001001110100101… |
… | …01001100101001111100 |
3 | 2110012101022101221202022 |
4 | 22010322111030221330 |
5 | 42321133400320134 |
6 | 1250040544215312 |
7 | 101013004012463 |
oct | 12047225145174 |
9 | 2405338357668 |
10 | 692468370044 |
11 | 247746384630 |
12 | b225630a538 |
13 | 503b7c86079 |
14 | 25730d1b9da |
15 | 1302cc7852e |
hex | a13a54ca7c |
692468370044 has 48 divisors (see below), whose sum is σ = 1400062690656. Its totient is φ = 296176742400.
The previous prime is 692468370043. The next prime is 692468370131. The reversal of 692468370044 is 440073864296.
It is a super-2 number, since 2×6924683700442 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (53) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (692468370043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3310142 + ... + 3513114.
It is an arithmetic number, because the mean of its divisors is an integer number (29167972722).
Almost surely, 2692468370044 is an apocalyptic number.
It is an amenable number.
692468370044 is an abundant number, since it is smaller than the sum of its proper divisors (707594320612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
692468370044 is a wasteful number, since it uses less digits than its factorization.
692468370044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 207566 (or 207564 counting only the distinct ones).
The product of its (nonzero) digits is 6967296, while the sum is 53.
The spelling of 692468370044 in words is "six hundred ninety-two billion, four hundred sixty-eight million, three hundred seventy thousand, forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •