Base | Representation |
---|---|
bin | 100001001110111010001101… |
… | …000011001101110101011001 |
3 | 201011111202202220210021020012 |
4 | 201032322031003031311121 |
5 | 123124141342444412213 |
6 | 1234505005152011305 |
7 | 42533501422151012 |
oct | 4116721503156531 |
9 | 634452686707205 |
10 | 146160103513433 |
11 | 42631174057a49 |
12 | 14486982b30b35 |
13 | 6372ab95b0b59 |
14 | 2814288658009 |
15 | 11d6e5e05c4a8 |
hex | 84ee8d0cdd59 |
146160103513433 has 16 divisors (see below), whose sum is σ = 158370054201216. Its totient is φ = 134352055783680.
The previous prime is 146160103513357. The next prime is 146160103513531. The reversal of 146160103513433 is 334315301061641.
146160103513433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-146160103513433 is a prime.
It is a super-2 number, since 2×1461601035134332 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (146160103512433) 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, 345188 + ... + 17100858.
It is an arithmetic number, because the mean of its divisors is an integer number (9898128387576).
Almost surely, 2146160103513433 is an apocalyptic number.
It is an amenable number.
146160103513433 is a deficient number, since it is larger than the sum of its proper divisors (12209950687783).
146160103513433 is a wasteful number, since it uses less digits than its factorization.
146160103513433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16767664.
The product of its (nonzero) digits is 233280, while the sum is 41.
The spelling of 146160103513433 in words is "one hundred forty-six trillion, one hundred sixty billion, one hundred three million, five hundred thirteen thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •