Base | Representation |
---|---|
bin | 1101101010000101010… |
… | …11011001000100101101 |
3 | 1122212021020111101002121 |
4 | 12311002223121010231 |
5 | 30142031121401123 |
6 | 555325114552541 |
7 | 45621644043013 |
oct | 6650253310455 |
9 | 1585236441077 |
10 | 469270106413 |
11 | 17101a817629 |
12 | 76b45738751 |
13 | 353377aaba4 |
14 | 189d9c9c8b3 |
15 | c317dce75d |
hex | 6d42ad912d |
469270106413 has 16 divisors (see below), whose sum is σ = 489668661504. Its totient is φ = 449292191040.
The previous prime is 469270106401. The next prime is 469270106471. The reversal of 469270106413 is 314601072964.
It is a cyclic number.
It is not a de Polignac number, because 469270106413 - 25 = 469270106381 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 469270106413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (469270106213) 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, 2232156 + ... + 2433322.
It is an arithmetic number, because the mean of its divisors is an integer number (30604291344).
Almost surely, 2469270106413 is an apocalyptic number.
It is an amenable number.
469270106413 is a deficient number, since it is larger than the sum of its proper divisors (20398555091).
469270106413 is a wasteful number, since it uses less digits than its factorization.
469270106413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202212.
The product of its (nonzero) digits is 217728, while the sum is 43.
The spelling of 469270106413 in words is "four hundred sixty-nine billion, two hundred seventy million, one hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •