Base | Representation |
---|---|
bin | 10101010011010001100… |
… | …100010100100010000110 |
3 | 12011221100002001111120200 |
4 | 111103101210110202012 |
5 | 142440333014340240 |
6 | 3040243533511330 |
7 | 210520306562646 |
oct | 25232144244206 |
9 | 5157302044520 |
10 | 1463804840070 |
11 | 514883741a81 |
12 | 1b7841342546 |
13 | a8061704501 |
14 | 50bc4530526 |
15 | 28124937930 |
hex | 154d1914886 |
1463804840070 has 48 divisors (see below), whose sum is σ = 3928663320192. Its totient is φ = 377756087040.
The previous prime is 1463804840053. The next prime is 1463804840083. The reversal of 1463804840070 is 700484083641.
1463804840070 is a `hidden beast` number, since 1 + 4 + 63 + 80 + 48 + 400 + 70 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 1463804839998 and 1463804840025.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 262327827 + ... + 262333406.
It is an arithmetic number, because the mean of its divisors is an integer number (81847152504).
Almost surely, 21463804840070 is an apocalyptic number.
1463804840070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1463804840070 is an abundant number, since it is smaller than the sum of its proper divisors (2464858480122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1463804840070 is a wasteful number, since it uses less digits than its factorization.
1463804840070 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 524661277 (or 524661274 counting only the distinct ones).
The product of its (nonzero) digits is 516096, while the sum is 45.
The spelling of 1463804840070 in words is "one trillion, four hundred sixty-three billion, eight hundred four million, eight hundred forty thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •