Base | Representation |
---|---|
bin | 1010101110000001011… |
… | …00110101001011000001 |
3 | 1022012122211012121000102 |
4 | 11113000230311023001 |
5 | 22013242112312021 |
6 | 441110322332145 |
7 | 35415642345524 |
oct | 5270054651301 |
9 | 1265584177012 |
10 | 368305197761 |
11 | 132219756366 |
12 | 5b4687ba055 |
13 | 289670c97a7 |
14 | 13b7ca26bbb |
15 | 98a90e600b |
hex | 55c0b352c1 |
368305197761 has 48 divisors (see below), whose sum is σ = 415378368000. Its totient is φ = 326025553920.
The previous prime is 368305197737. The next prime is 368305197763. The reversal of 368305197761 is 167791503863.
It is not a de Polignac number, because 368305197761 - 222 = 368301003457 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 368305197697 and 368305197706.
It is not an unprimeable number, because it can be changed into a prime (368305197763) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 47039795 + ... + 47047623.
It is an arithmetic number, because the mean of its divisors is an integer number (8653716000).
Almost surely, 2368305197761 is an apocalyptic number.
368305197761 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
It is an amenable number.
368305197761 is a deficient number, since it is larger than the sum of its proper divisors (47073170239).
368305197761 is a wasteful number, since it uses less digits than its factorization.
368305197761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8042 (or 8025 counting only the distinct ones).
The product of its (nonzero) digits is 5715360, while the sum is 56.
The spelling of 368305197761 in words is "three hundred sixty-eight billion, three hundred five million, one hundred ninety-seven thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •