Base | Representation |
---|---|
bin | 101011100010010000… |
… | …010100000000000000 |
3 | 11110122210002112002112 |
4 | 223202100110000000 |
5 | 1231213333200000 |
6 | 33250304234452 |
7 | 3243254021051 |
oct | 534220240000 |
9 | 143583075075 |
10 | 46745600000 |
11 | 18908744180 |
12 | 908700ba28 |
13 | 453c765158 |
14 | 2396424728 |
15 | 1338ced235 |
hex | ae2414000 |
46745600000 has 360 divisors, whose sum is σ = 129011805216. Its totient is φ = 16793600000.
The previous prime is 46745599981. The next prime is 46745600017. The reversal of 46745600000 is 654764.
It is a super-2 number, since 2×467456000002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 46745600000.
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, 563199959 + ... + 563200041.
Almost surely, 246745600000 is an apocalyptic number.
46745600000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 46745600000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64505902608).
46745600000 is an abundant number, since it is smaller than the sum of its proper divisors (82266205216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
46745600000 is an frugal number, since it uses more digits than its factorization.
46745600000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147 (or 101 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 32.
The spelling of 46745600000 in words is "forty-six billion, seven hundred forty-five million, six hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •