Base | Representation |
---|---|
bin | 1100000001101000… |
… | …0111010000111001 |
3 | 22022222011222220001 |
4 | 3000122013100321 |
5 | 23102341232334 |
6 | 1252152433001 |
7 | 142665102424 |
oct | 30032072071 |
9 | 8288158801 |
10 | 3228070969 |
11 | 1407186552 |
12 | 7610a8761 |
13 | 3c5a19786 |
14 | 228a149bb |
15 | 13d5e5714 |
hex | c0687439 |
3228070969 has 4 divisors (see below), whose sum is σ = 3228233296. Its totient is φ = 3227908644.
The previous prime is 3228070961. The next prime is 3228071009. The reversal of 3228070969 is 9690708223.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3228070969 - 23 = 3228070961 is a prime.
It is a super-2 number, since 2×32280709692 = 20840884361801197922, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3228070961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 46359 + ... + 92764.
It is an arithmetic number, because the mean of its divisors is an integer number (807058324).
Almost surely, 23228070969 is an apocalyptic number.
It is an amenable number.
3228070969 is a deficient number, since it is larger than the sum of its proper divisors (162327).
3228070969 is a wasteful number, since it uses less digits than its factorization.
3228070969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162326.
The product of its (nonzero) digits is 326592, while the sum is 46.
The square root of 3228070969 is about 56816.1153987141. The cubic root of 3228070969 is about 1477.9089915171.
The spelling of 3228070969 in words is "three billion, two hundred twenty-eight million, seventy thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •