Base | Representation |
---|---|
bin | 100001010001001111011101… |
… | …010010001110010001010101 |
3 | 201012002002102201001202121202 |
4 | 201101033131102032101111 |
5 | 123134303101013231423 |
6 | 1235110351425522245 |
7 | 42551204002634423 |
oct | 4121173522162125 |
9 | 635062381052552 |
10 | 146320363414613 |
11 | 42693132646773 |
12 | 144b1a497a3385 |
13 | 6384c49648a4b |
14 | 281bd2c8a4113 |
15 | 11db1dd737728 |
hex | 8513dd48e455 |
146320363414613 has 8 divisors (see below), whose sum is σ = 147141487785600. Its totient is φ = 145499280068128.
The previous prime is 146320363414591. The next prime is 146320363414619. The reversal of 146320363414613 is 316414363023641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146320363414613 - 214 = 146320363398229 is a prime.
It is a super-3 number, since 3×1463203634146133 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146320363414619) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3088781 + ... + 17383362.
It is an arithmetic number, because the mean of its divisors is an integer number (18392685973200).
Almost surely, 2146320363414613 is an apocalyptic number.
It is an amenable number.
146320363414613 is a deficient number, since it is larger than the sum of its proper divisors (821124370987).
146320363414613 is a wasteful number, since it uses less digits than its factorization.
146320363414613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20512251.
The product of its (nonzero) digits is 2239488, while the sum is 47.
The spelling of 146320363414613 in words is "one hundred forty-six trillion, three hundred twenty billion, three hundred sixty-three million, four hundred fourteen thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •