Base | Representation |
---|---|
bin | 10100111100011011110000… |
… | …11111111110111010001000 |
3 | 20001002000001110011101001021 |
4 | 22132031320133332322020 |
5 | 22014044121211340224 |
6 | 241542135023202224 |
7 | 12462335206215202 |
oct | 1236157037767210 |
9 | 201060043141037 |
10 | 46056955965064 |
11 | 13747710a38030 |
12 | 51ba191446374 |
13 | 1c911c9822c25 |
14 | b53250771772 |
15 | 54d0a90661e4 |
hex | 29e3787fee88 |
46056955965064 has 32 divisors (see below), whose sum is σ = 94208136618240. Its totient is φ = 20934818497600.
The previous prime is 46056955965049. The next prime is 46056955965079.
46056955965064 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (46056955965049) and next prime (46056955965079).
It is a junction number, because it is equal to n+sod(n) for n = 46056955964984 and 46056955965002.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9848649 + ... + 13751719.
It is an arithmetic number, because the mean of its divisors is an integer number (2944004269320).
Almost surely, 246056955965064 is an apocalyptic number.
46056955965064 is a gapful number since it is divisible by the number (44) formed by its first and last digit.
It is an amenable number.
46056955965064 is an abundant number, since it is smaller than the sum of its proper divisors (48151180653176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46056955965064 is a wasteful number, since it uses less digits than its factorization.
46056955965064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4037181 (or 4037177 counting only the distinct ones).
The product of its (nonzero) digits is 1049760000, while the sum is 70.
The spelling of 46056955965064 in words is "forty-six trillion, fifty-six billion, nine hundred fifty-five million, nine hundred sixty-five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •