Base | Representation |
---|---|
bin | 111000110011100011… |
… | …100011010010010011 |
3 | 12211102210220121220121 |
4 | 320303203203102103 |
5 | 1444404042442411 |
6 | 44004231451111 |
7 | 4256333456554 |
oct | 706343432223 |
9 | 184383817817 |
10 | 60994499731 |
11 | 2395a894470 |
12 | b9a2b26a97 |
13 | 59a07bc979 |
14 | 2d489ac32b |
15 | 18bebe9571 |
hex | e338e3493 |
60994499731 has 8 divisors (see below), whose sum is σ = 67476630528. Its totient is φ = 54668565000.
The previous prime is 60994499729. The next prime is 60994499737. The reversal of 60994499731 is 13799449906.
60994499731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 60994499731 - 21 = 60994499729 is a prime.
It is a super-2 number, since 2×609944997312 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 60994499731.
It is not an unprimeable number, because it can be changed into a prime (60994499737) 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, 39048195 + ... + 39049756.
It is an arithmetic number, because the mean of its divisors is an integer number (8434578816).
Almost surely, 260994499731 is an apocalyptic number.
60994499731 is a deficient number, since it is larger than the sum of its proper divisors (6482130797).
60994499731 is a wasteful number, since it uses less digits than its factorization.
60994499731 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78098033.
The product of its (nonzero) digits is 13226976, while the sum is 61.
The spelling of 60994499731 in words is "sixty billion, nine hundred ninety-four million, four hundred ninety-nine thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •