Base | Representation |
---|---|
bin | 111101011011111… |
… | …0010010101101110 |
3 | 12022122222020011220 |
4 | 1322313302111232 |
5 | 13210212210322 |
6 | 540315524210 |
7 | 102040663110 |
oct | 17267622556 |
9 | 5278866156 |
10 | 2061444462 |
11 | 9686a4810 |
12 | 496459666 |
13 | 26b10b92c |
14 | 157ad13b0 |
15 | c0e9d55c |
hex | 7adf256e |
2061444462 has 64 divisors (see below), whose sum is σ = 5148983808. Its totient is φ = 534528000.
The previous prime is 2061444461. The next prime is 2061444481. The reversal of 2061444462 is 2644441602.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2061444461) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 292662 + ... + 299622.
It is an arithmetic number, because the mean of its divisors is an integer number (80452872).
Almost surely, 22061444462 is an apocalyptic number.
2061444462 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 2061444462, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2574491904).
2061444462 is an abundant number, since it is smaller than the sum of its proper divisors (3087539346).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2061444462 is a wasteful number, since it uses less digits than its factorization.
2061444462 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7625.
The product of its (nonzero) digits is 36864, while the sum is 33.
The square root of 2061444462 is about 45403.1327333258. The cubic root of 2061444462 is about 1272.6936569541.
The spelling of 2061444462 in words is "two billion, sixty-one million, four hundred forty-four thousand, four hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •