Base | Representation |
---|---|
bin | 10101010110001110111101… |
… | …01011001010011101010100 |
3 | 20011012202012120220202021110 |
4 | 22223013132223022131110 |
5 | 22123110122424404324 |
6 | 243501303212015020 |
7 | 12613360020326553 |
oct | 1253073653123524 |
9 | 204182176822243 |
10 | 46943433434964 |
11 | 13a596643a7910 |
12 | 5321b50a61470 |
13 | 2026992897321 |
14 | b84107c4dd9a |
15 | 56618e327329 |
hex | 2ab1deaca754 |
46943433434964 has 48 divisors (see below), whose sum is σ = 119544127496640. Its totient is φ = 14219121968640.
The previous prime is 46943433434959. The next prime is 46943433435011.
46943433434964 is nontrivially palindromic in base 10.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a junction number, because it is equal to n+sod(n) for n = 46943433434895 and 46943433434904.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 76705189 + ... + 77314764.
It is an arithmetic number, because the mean of its divisors is an integer number (2490502656180).
Almost surely, 246943433434964 is an apocalyptic number.
46943433434964 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
46943433434964 is an abundant number, since it is smaller than the sum of its proper divisors (72600694061676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46943433434964 is a wasteful number, since it uses less digits than its factorization.
46943433434964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154022280 (or 154022278 counting only the distinct ones).
The product of its digits is 967458816, while the sum is 66.
The spelling of 46943433434964 in words is "forty-six trillion, nine hundred forty-three billion, four hundred thirty-three million, four hundred thirty-four thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •