Base | Representation |
---|---|
bin | 111010110010001… |
… | …0110011100101001 |
3 | 12002110112112010001 |
4 | 1311210112130221 |
5 | 13014422312101 |
6 | 523420423001 |
7 | 66610443106 |
oct | 16544263451 |
9 | 5073475101 |
10 | 1972463401 |
11 | 922449a47 |
12 | 4706a7a61 |
13 | 25585570c |
14 | 149d6baad |
15 | b8273901 |
hex | 75916729 |
1972463401 has 4 divisors (see below), whose sum is σ = 1979195652. Its totient is φ = 1965731152.
The previous prime is 1972463399. The next prime is 1972463411. The reversal of 1972463401 is 1043642791.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1032979600 + 939483801 = 32140^2 + 30651^2 .
It is a cyclic number.
It is not a de Polignac number, because 1972463401 - 21 = 1972463399 is a prime.
It is a super-2 number, since 2×19724634012 = 7781223736568973602, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1972463411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3365686 + ... + 3366271.
It is an arithmetic number, because the mean of its divisors is an integer number (494798913).
Almost surely, 21972463401 is an apocalyptic number.
It is an amenable number.
1972463401 is a deficient number, since it is larger than the sum of its proper divisors (6732251).
1972463401 is an equidigital number, since it uses as much as digits as its factorization.
1972463401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6732250.
The product of its (nonzero) digits is 36288, while the sum is 37.
The square root of 1972463401 is about 44412.4239487106. The cubic root of 1972463401 is about 1254.1119839844. Note that the first 3 decimals are identical.
The spelling of 1972463401 in words is "one billion, nine hundred seventy-two million, four hundred sixty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •