Base | Representation |
---|---|
bin | 100011001101110101010011… |
… | …0011110101010101101000001 |
3 | 1111121210012010100002100221221 |
4 | 1012123222212132222231001 |
5 | 311100140020120113301 |
6 | 3014451451222115041 |
7 | 122150512130323321 |
oct | 10633524636525501 |
9 | 1447705110070857 |
10 | 309764424379201 |
11 | 8a77839a024940 |
12 | 2a8aa506b7ba81 |
13 | 103ac8769a937c |
14 | 566c96cb39281 |
15 | 25c2a3be97da1 |
hex | 119baa67aab41 |
309764424379201 has 16 divisors (see below), whose sum is σ = 338157360636480. Its totient is φ = 281410276230720.
The previous prime is 309764424379199. The next prime is 309764424379243. The reversal of 309764424379201 is 102973424467903.
It is a cyclic number.
It is not a de Polignac number, because 309764424379201 - 21 = 309764424379199 is a prime.
It is a super-2 number, since 2×3097644243792012 (a number of 30 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 309764424379201.
It is not an unprimeable number, because it can be changed into a prime (309764424379301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 191626590 + ... + 193236328.
It is an arithmetic number, because the mean of its divisors is an integer number (21134835039780).
Almost surely, 2309764424379201 is an apocalyptic number.
It is an amenable number.
309764424379201 is a deficient number, since it is larger than the sum of its proper divisors (28392936257279).
309764424379201 is a wasteful number, since it uses less digits than its factorization.
309764424379201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1621776.
The product of its (nonzero) digits is 54867456, while the sum is 61.
The spelling of 309764424379201 in words is "three hundred nine trillion, seven hundred sixty-four billion, four hundred twenty-four million, three hundred seventy-nine thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •