Base | Representation |
---|---|
bin | 101011010101000101… |
… | …0101101001010100000 |
3 | 22220011202120110210000 |
4 | 1112222022231022200 |
5 | 3011031101340433 |
6 | 110425104140000 |
7 | 6502563354441 |
oct | 1265212551240 |
9 | 286152513700 |
10 | 93049246368 |
11 | 36509968011 |
12 | 1604a007600 |
13 | 8a0b789b80 |
14 | 4709c832c8 |
15 | 2648dec113 |
hex | 15aa2ad2a0 |
93049246368 has 240 divisors, whose sum is σ = 296371262880. Its totient is φ = 28468744704.
The previous prime is 93049246327. The next prime is 93049246373. The reversal of 93049246368 is 86364294039.
93049246368 is a `hidden beast` number, since 9 + 30 + 4 + 9 + 246 + 368 = 666.
It is a super-2 number, since 2×930492463682 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 6023871 + ... + 6039297.
It is an arithmetic number, because the mean of its divisors is an integer number (1234880262).
Almost surely, 293049246368 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 93049246368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148185631440).
93049246368 is an abundant number, since it is smaller than the sum of its proper divisors (203322016512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
93049246368 is a wasteful number, since it uses less digits than its factorization.
93049246368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15641 (or 15624 counting only the distinct ones).
The product of its (nonzero) digits is 6718464, while the sum is 54.
The spelling of 93049246368 in words is "ninety-three billion, forty-nine million, two hundred forty-six thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •